给定一个字符串 s ,你需要反转字符串中每个单词的字符顺序,同时仍保留空格和单词的初始顺序。

* 输入:s = "Let's take LeetCode contest"
* 输出:"s'teL ekat edoCteeL tsetnoc"
* 输入: s = "God Ding"
* 输出:"doG gniD"

public class RevertStrsSpace {
    public static String reverseWords(String s) {
        String[] split = s.split("[ ]");
        String targetStr = "";
        for (int i = 0; i < split.length; i++) {
            char[] chars = split[i].toCharArray();
            Stack stack = new Stack();
            for (char a : chars) {
                stack.push(a);
            }
            for (int j = 0; j < chars.length; j++) {
                chars[j] = (char) stack.pop();
            }
            targetStr = targetStr + (new String(chars)) + " ";
        }
        targetStr = targetStr.substring(0, targetStr.length() - 1);
        return targetStr;
    }

    public static void main(String[] args) {
        String s = reverseWords("Let's take LeetCode contest");
        System.out.println(s);
    }
}


版权声明:本文为pshdhx原创文章,遵循CC 4.0 BY-SA版权协议,转载请附上原文出处链接和本声明。