【字符串】力扣344.反转字符串&541. 反转字符串II&剑指Offer 05.替换空格&151.翻转字符串里的单词&剑指Offer58-II.左旋转字符串

344.反转字符串

题目：

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

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

541. 反转字符串II

题目：

 

class Solution {
    public String reverseStr(String s, int k) {
        char[] ch = s.toCharArray();

        // 1. 每隔 2k 个字符的前 k 个字符进行反转
        for (int i = 0; i < ch.length; i += 2 * k) {
            if (i + k > ch.length) {
                reverse(ch, i, ch.length - 1);
            } else {
                reverse(ch, i, i + k - 1);
            }

        }
        return new String(ch);
    }

    public void reverse(char[] ch, int i, int j) {
        for (; i < j; i++, j--) {
            char temp = ch[i];
            ch[i] = ch[j];
            ch[j] = temp;
        }
    }
}

剑指Offer 05.替换空格

题目：

class Solution {
    public String replaceSpace(String s) {
        if (s==null)
            return null;

        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.翻转字符串里的单词

题目：

先将整个字符串反转后，再按照单词逐个反转，超出时间限制。且没有将空格删除。

代码：

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

        reverse(ch,0,ch.length-1);

        int i=0;
        int k=0;
        for (;i<ch.length;i++){
            while (!(ch[k]==' ')){
                k++;
            }

            if (i==k){
                k++;
                continue;
            }

            reverse(ch,i,k-1);

            i=k;
        }

        return ch.toString();
    }
    public void reverse(char[] ch, int i, int j) {
        for (; i < j; i++, j--) {
            char temp = ch[i];
            ch[i] = ch[j];
            ch[j] = temp;
        }
    }
}

return不能写成ch.toString，因为数组的toString默认返回Object，也就是返回哈希码值，这里应该return new String(数组)

注意数组长度的缩减

class Solution {
    public String reverseWords(String s) {
        char[] ch =s.toCharArray();
        StringBuilder sb=removeSpace(ch);
        reverseString(sb,0,sb.length()-1);
        reverseEachWord(sb);
        return sb.toString();
    }


    public StringBuilder removeSpace(char[] ch){
        int slow=0;
        int fast=0;

        while (fast<ch.length){
            if (ch[fast]!=' '&&slow<=fast){
                ch[slow]=ch[fast];
                fast++;
                slow++;
            }
            else if (ch[fast]==' '&&slow!=0&&ch[slow-1]!=' '){
                ch[slow]=' ';
                fast++;
                slow++;
            }
            else {
                fast++;
            }
        }

        if (ch[slow-1]==' ')
            slow--;

        StringBuilder sb=new StringBuilder();
        for (int i=0;i<slow;i++){
            sb.append(ch[i]);
        }
        return sb;
    }

    public void reverseString(StringBuilder sb, int start, int end) {
        while (start < end) {
            char temp = sb.charAt(start);
            sb.setCharAt(start, sb.charAt(end));
            sb.setCharAt(end, temp);
            start++;
            end--;
        }
    }

    private void reverseEachWord(StringBuilder sb) {
        int start = 0;
        int end = 1;
        int n = sb.length();
        while (start < n) {
            while (end < n && sb.charAt(end) != ' ') {
                end++;
            }
            reverseString(sb, start, end - 1);
            start = end + 1;
            end = start + 1;
        }
    }
}

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

题目：

class Solution {
    public String reverseLeftWords(String s, int n) {
        StringBuilder sb =new StringBuilder();
        char[] ch =s.toCharArray();

        for (int i=n;i<ch.length;i++){
            sb.append(ch[i]);
        }

        for (int i=0;i<n;i++){
            sb.append(ch[i]);
        }

        return sb.toString();
    }
}