给定一个字符串,逐个翻转字符串中的每个单词。
说明:
- 无空格字符构成一个 单词 。
- 输入字符串可以在前面或者后面包含多余的空格,但是反转后的字符不能包括。
- 如果两个单词间有多余的空格,将反转后单词间的空格减少到只含一个。
示例 1:
输入:“the sky is blue”
输出:“blue is sky the”
示例 2:
输入:" hello world! "
输出:“world! hello”
解释:输入字符串可以在前面或者后面包含多余的空格,但是反转后的字符不能包括。
示例 3:
输入:“a good example”
输出:“example good a”
解释:如果两个单词间有多余的空格,将反转后单词间的空格减少到只含一个。
示例 4:
输入:s = " Bob Loves Alice "
输出:“Alice Loves Bob”
示例 5:
输入:s = “Alice does not even like bob”
输出:“bob like even not does Alice”
队列存储
class Solution {
public String reverseWords(String s) {
int len = s.length();
int start = 0, end = len;
while (s.charAt(start) == ' ')
start++;
while (s.charAt(end - 1) == ' ')
end--;
if (end == len)
s += " ";
Deque<String> list = new LinkedList<>();
StringBuilder word = new StringBuilder();
for (int i = start; i <= end; i++) {
char c = s.charAt(i);
if (c != ' ') {
word.append(c);
} else if (word.length() != 0) {
list.addFirst(word.toString());
word.setLength(0);
}
}
return String.join(" ", list);
}
}
StringBuilder存储
class Solution {
public String reverseWords(String s) {
StringBuilder sb = new StringBuilder();
int right = s.length() - 1;
int left = right;
while (left >= 0) {
while (right >= 0 && s.charAt(right) == ' ')
right--;
left = right;
while (left >= 0 && s.charAt(left) != ' ')
left--;
sb.append(s.substring(left + 1, right + 1) + " ");
right = left;
}
return sb.toString().trim();
}
}
系统函数
class Solution {
public String reverseWords(String s) {
s = s.trim();
List<String> wordList = Arrays.asList(s.split("\\s+"));
Collections.reverse(wordList);
return String.join(" ", wordList);
}
}