1.题目描述:
给你一个字符串s,颠倒字符串中单词的顺序。单词是由非空格字符组成的字符串。s中使用至少一个空格将字符串中的单词分隔开。返回单词顺序颠倒且单词之间用单个空格连接的结果字符串。注意:输入字符串s中可能会存在前导空格、尾随空格或者单词间的多个空格。返回的结果字符串中,单词间应当仅用单个空格分隔,且不包含任何额外的空格。
2.自己写的解法:双指针/结合栈,不少细节需要注意。
class Solution {
public String reverseWords(String s) {
Stack<String> stack = new Stack<>();
int left = 0;
int right = 0;
while (left < s.length()) {
while (left < s.length() && s.charAt(left) == ' ') {
left++;
right++;
}
while (right < s.length() && s.charAt(right) != ' ') {
right++;
}
if (left != s.length()) stack.push(s.substring(left, right));//否则多添加空格
left = right;
}
StringBuilder sb = new StringBuilder();
while (!stack.isEmpty()) {
sb.append(stack.pop());
if (!stack.isEmpty()) sb.append(" ");
}
return sb.toString();
}
}
3.去掉栈直接拼接StringBuilder:
class Solution {
public String reverseWords(String s) {
StringBuilder sb = new StringBuilder();
int left = s.length() - 1;
int right = s.length() - 1;
while (left >= 0) {//从尾遍历
while (left >= 0 && s.charAt(left) == ' ') {
left--;
right--;
}
while (left >= 0 && s.charAt(left) != ' ') {
left--;
}
for (int i = left + 1; i <= right; i++) {
sb.append(s.charAt(i));
}
if (left > 0) sb.append(' ');
right = left;
}
if (sb.charAt(sb.length() - 1) == ' ') sb.deleteCharAt(sb.length() - 1);//额外考虑
return sb.toString();
}
}
4.官方题解评论区的双指针(借助i遍历):
class Solution {
public String reverseWords(String s) {
int start, end; // 每个单词的开始和结束索引(左闭右开)
StringBuilder sb = new StringBuilder();
for (int i = s.length() - 1; i >= 0; i--) {
if (s.charAt(i) == ' ') continue; //跳过空格
end = i + 1; //找到结束索引
while (i >= 0 && s.charAt(i) != ' ') i--; //跳过空格
start = i + 1; //找到开始索引
for (int j = start; j < end; j++) //将每个单词按开始结束索引赋值到StringBuilder
sb.append(s.charAt(j));
sb.append(' '); //加上单词间的空格
}
sb.deleteCharAt(sb.length() - 1); //删掉最后一个多余的空格
return sb.toString();
}
}