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

344.反转字符串 Reverse String - LeetCode

双指针

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 Reverse String II - LeetCode

abcdefgz k = 3

cbadefzg

for (int i = 0; i < s.length(); i += 2k)//i 都是2K，2K的移动

        if (i + k <= s.length()){

                reverse(s, i, i + k);//左闭右开，不包括i+ k

                continue;

        }

        reverse(s, i, s.length());

class Solution {
    public String reverseStr(String s, int k) {
        char[] arr = s.toCharArray();
        for (int i = 0; i < arr.length; i += 2 * k) {
            if (i + k <= arr.length) {
                reverse(arr, i, i + k - 1);
                continue;
            }
            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.替换空格 剑指 Offer 05. 替换空格 - 力扣（Leetcode）

国服竟然还有额外的题

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.翻转字符串里的单词 Reverse Words in a String - LeetCode

       先全部反转，再一个个翻转

1. reverse whole sentence

2.reverse each word

class Solution {
    public String reverseWords(String s) {
        s = removeSpace(s);
        s = s.trim();
        if (s == null || s.length() == 0) return "";
        int left = 0;
        int right = s.length() - 1;
        char[] array = s.toCharArray();
        //reverse whole sentence
        reverse(array, left, right);
        //reverse single word
        int start = 0;
        for (int i = 0; i < array.length; i++) {
            if (array[i] == ' ') continue;
            if (i == 0 || array[i - 1] == ' ') {
                start = i;
            }
            if (i == array.length - 1 || array[i + 1] == ' ') {
                reverse(array, start, i);
            }
        }
        return new String(array);
    }
    
    private void reverse(char[] array, int left, int right) {
        while (left < right) {
            char tmp = array[left];
            array[left] = array[right];
            array[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.左旋转字符串  剑指 Offer 58 - II. 左旋转字符串 - 力扣（Leetcode）

1. 反转区间为前n的子串
2. 反转区间为n到末尾的子串
3. 反转整个字符串

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;
        }
    }
}