给定一个字符串,你需要反转字符串中每个单词的字符顺序,同时仍保留空格和单词的初始顺序。
示例 1:
输入: "Let's take LeetCode contest"
输出: "s'teL ekat edoCteeL tsetnoc"
注意:在字符串中,每个单词由单个空格分隔,并且字符串中不会有任何额外的空格。
解题代码:
class Solution {
public String reverseWords(String s) {
if (s == null || s.length() < 2)
return s;
StringBuilder sb = new StringBuilder();
for (String ss : s.split(" ")) {
char[] chars = ss.toCharArray();
int i = 0;
int j = chars.length - 1;
while (i < j) {
//交换
char temp = chars[i];
chars[i] = chars[j];
chars[j] = temp;
i++;
j--;
}
sb.append(" ").append(String.valueOf(chars));
}
return sb.toString().replaceFirst(" ", "");
}
public static void main(String[] args) {
Solution s = new Solution();
System.out.println(s.reverseWords("Let's take LeetCode contest"));
}
}