代码随想录算法训练营20期|第八天|字符串part01|● 344.反转字符串● 541. 反转字符串II● 剑指Offer 05.替换空格● 151.翻转字符串里的单词● 剑指Offer58

344.反转字符串

双指针,面试的时候有被要求过位运算来解答，位运算还是要了解

Time：O(n)

Space：O(1)

class Solution {
    public void reverseString(char[] s) {
        int left = 0;
        int right = s.length - 1;

        while (left < right) {
            char tmp = s[left];
            s[left] = s[right];
            s[right] = tmp;
            left++;
            right--;
        }

    }
}

541. 反转字符串II

每次移动2K

class Solution {
    public String reverseStr(String s, int k) {
        char[] arr = s.toCharArray();
        for (int i = 0; i < s.length(); i += 2*k){
            //剩余字符小于2K但大于或等于k个，则反转前k个字符
            if (i + k <= arr.length) {
                reverse(arr, i, i + k - 1);
                continue;
            }
            //剩余字符小于k个，则将剩余字符全部反转
            reverse(arr, i, arr.length - 1);
        }
        return new String(arr);

    }

    private void reverse(char[] arr, int left, int right) {
        for (; left < right; left++, right--) {
            char tmp = arr[left];
            arr[left] = arr[right];
            arr[right] = tmp;
        }
    }
}

剑指Offer 05.替换空格

Time:O(n)

Space: O(n)

class Solution {
    public String replaceSpace(String s) {
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < s.length(); i++) {
            if (s.charAt(i) == ' '){
                sb.append("%20");
            } else {
                sb.append(s.charAt(i));
            }
        }
        return sb.toString();

    }
}

151.翻转字符串里的单词

先removespace，把整个句子反转，再一个一个单词反转。

实现起来还是有点麻烦

class Solution {
    public String reverseWords(String s) {
        s = removeSpace(s);
        s = s.trim();
        if (s == null || s.length() == 0) return "";

        char[] arr = s.toCharArray();
        reverse(arr, 0, arr.length - 1);
        int start = 0;
        for (int i = 0; i < arr.length; i++) {
            if (arr[i] == ' ') continue;
            if (i == 0 || arr[i - 1] == ' ') {
                start = i;
            }
            if (i == arr.length - 1 || arr[i + 1] == ' ') {
                reverse(arr, start, i);
            }
        }
        return new String(arr);
    }

    private void reverse(char[] arr, int left, int right) {
        while (left < right) {
            char tmp = arr[left];
            arr[left] = arr[right];
            arr[right] = tmp;
            left++;
            right--;
        }
    }

    private String removeSpace(String s) {
        StringBuilder sb = new StringBuilder();
        int start = 0;
        for (int i = 0; i < s.length(); i++) {
            if (s.charAt(i) == ' ') continue;
            if (i == 0 || s.charAt(i - 1) == ' ') {
                start = i;
            }
            if (i == s.length() - 1 || s.charAt(i + 1) == ' ') {
                sb.append(s.substring(start, i + 1)).append(' ');
            }
        }
        return sb.toString();
    }
}

剑指Offer58-II.左旋转字符串

class Solution {
    public String reverseLeftWords(String s, int n) {
        char[] arr = s.toCharArray();
        reverse(arr, 0,  n - 1);
        reverse(arr,  n , arr.length - 1);
        reverse(arr, 0, arr.length - 1);
        return new String(arr);
    }

    private void reverse(char[] arr, int left, int right) {
        for (; left < right; left++, right--) {
            char tmp = arr[left];
            arr[left] = arr[right];
            arr[right] = tmp;
        }
    }
}