151. 颠倒字符串中的单词

LeetCode链接

API 法

class Solution {
    public String reverseWords(String s) {
        // 去除首尾的空格
        s = s.trim();
        // 以空格为分隔获取字符串集合
        List<String> arr = Arrays.asList(s.split("\\s+"));
        Collections.reverse(arr);
        return String.join(" ", arr);
    }
}

题解解法

• 时间复杂度：O(n)
• 空间复杂度：O(n)

队列

class Solution {
    public String reverseWords(String s) {
        int l = 0;
        int r = s.length()-1;
        
        while(l <= r && s.charAt(l) == ' ') ++l;
        while(l <= r && s.charAt(r) == ' ') --r;

        Deque<String> que = new ArrayDeque<>();
        StringBuilder sb = new StringBuilder();

        while(l <= r){
            char c = s.charAt(l);
            if((sb.length() != 0) && c == ' '){
                que.offerFirst(sb.toString());
                sb.setLength(0);
            } else if(c != ' '){
                sb.append(c);
            }
            l++;
        }
        que.offerFirst(sb.toString());
        return String.join(" ", que);
    }
}

题解解法

• 时间复杂度：O(n)
• 空间复杂度：O(n)

填充

class Solution {
    public String reverseWords(String s) {
        
        char[] charArr = s.toCharArray();

        char[] newArr = new char[charArr.length+1];

        // 新字符串数组指针
        int pos = 0;

        int i = charArr.length-1;
        while(i >= 0){
            while(i >= 0 && charArr[i] == ' ') i--;
            int r = i;
            while(i >= 0 && charArr[i] != ' ') i--;
            for(int j = i+1; j <= r; j++){
                newArr[pos++] = charArr[j];
                if(j == r){
                    newArr[pos++] = ' ';
                }
            }
        }

        return new String(newArr, 0, pos-1);
    }
}

• 时间复杂度：O(n)
• 空间复杂度：O(n)

双指针反转

class Solution {
    public String reverseWords(String s) {
        // 去除多余的空格
        String str = removeSpace(s);

        char[] chars = str.toCharArray();
        switchString(chars, 0, chars.length-1);

        for(int l = 0, r = 0; r < chars.length; r++){
            if(chars[r] == ' '){
                switchString(chars, l, r-1);
                l = r+1;
            } else if(r == chars.length-1){
                switchString(chars, l, r);
            }
        }

        return new String(chars);
    }

    public String removeSpace(String s){
        int l = 0;
        int r = s.length()-1;

        while(s.charAt(l) == ' ') l++;
        while(s.charAt(r) == ' ') r--;

        StringBuilder sb = new StringBuilder();
        for(;l < r+1; l++){
            if(!(s.charAt(l) == ' ') || !(s.charAt(l-1) == ' ')){
                sb.append(s.charAt(l));
            }
        }

        return sb.toString();
    }

    public void switchString(char[] c, int l, int r){
        while(l < r){
            char temp = c[l];
            c[l] = c[r];
            c[r] = temp;
            l++;
            r--;
        }
    }
}

• 时间复杂度：O(n)
• 空间复杂度：O(n)