Day08｜字符串01:344.反转字符串、541. 反转字符串II、卡码网：54.替换数字、151.翻转字符串里的单词、剑指Offer58-II.左旋转字符串

`# 344. 反转字符串

没啥好说的，快慢指针逼近：

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

char[] charArray = {'H', 'e', 'l', 'l', 'o'};
String str = new String(charArray);

（这里传入的是数组，如果是字符串用这个方法转发成数组再字符串）

541. 反转字符串II

注意边界情况的考虑。

class Solution {
    public String reverseStr(String s, int k) {
        char[] chars = s.toCharArray();
        for(int i = 0; i < chars.length; i += 2 * k){
            int start = i;
            int end = Math.min(chars.length - 1, start + k - 1);
            while(start <= end){
                char tmp = chars[start];
                chars[start] = chars[end];
                chars[end] = tmp;
                start++;
                end--;
            }
        }
        return new String(chars);
    }
}

卡码网：54.替换数字

本题是ACM模式，而且相对之前一刷有换题，所以犯了难，主要不知道Java的ACM模式怎么写，会写了还是很简单的：

import java.util.Scanner;

class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        String s = in.nextLine();
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < s.length(); i++) {
            if (Character.isDigit(s.charAt(i))) {
                sb.append("number");
            }else sb.append(s.charAt(i));
        }
        System.out.println(sb);
    }
}

• import java.util.Scanner:java用来读取输入类Scanner。
• StringBuilder相当于java方便对字符串进行修改而创造出来的builder。

实际上这个方法并不巧妙，因为java不能对String进行直接修改而必须申请额外空间，这里贴一个cpp解法：

#include<iostream>
using namespace std;
int main() {
    string s;
    while (cin >> s) {
        int count = 0; // 统计数字的个数
        int sOldSize = s.size();
        for (int i = 0; i < s.size(); i++) {
            if (s[i] >= '0' && s[i] <= '9') {
                count++;
            }
        }
        // 扩充字符串s的大小，也就是每个空格替换成"number"之后的大小
        s.resize(s.size() + count * 5);
        int sNewSize = s.size();
        // 从后先前将空格替换为"number"
        for (int i = sNewSize - 1, j = sOldSize - 1; j < i; i--, j--) {
            if (s[j] > '9' || s[j] < '0') {
                s[i] = s[j];
            } else {
                s[i] = 'r';
                s[i - 1] = 'e';
                s[i - 2] = 'b';
                s[i - 3] = 'm';
                s[i - 4] = 'u';
                s[i - 5] = 'n';
                i -= 5;
            }
        }
        cout << s << endl;
    }
}

• 遍历统计数字个数
• 扩充字符串大小；
• 从后往前替换。

151.翻转字符串里的单词

先删除空格，再翻转整个字符串，再翻转里面的单词。

class Solution {
   /**
     * 不使用Java内置方法实现
     * <p>
     * 1.去除首尾以及中间多余空格
     * 2.反转整个字符串
     * 3.反转各个单词
     */
    public String reverseWords(String s) {
        // System.out.println("ReverseWords.reverseWords2() called with: s = [" + s + "]");
        // 1.去除首尾以及中间多余空格
        StringBuilder sb = removeSpace(s);
        // 2.反转整个字符串
        reverseString(sb, 0, sb.length() - 1);
        // 3.反转各个单词
        reverseEachWord(sb);
        return sb.toString();
    }

    private StringBuilder removeSpace(String s) {
        // System.out.println("ReverseWords.removeSpace() called with: s = [" + s + "]");
        int start = 0;
        int end = s.length() - 1;
        while (s.charAt(start) == ' ') start++;
        while (s.charAt(end) == ' ') end--;
        StringBuilder sb = new StringBuilder();
        while (start <= end) {
            char c = s.charAt(start);
            if (c != ' ' || sb.charAt(sb.length() - 1) != ' ') {
                sb.append(c);
            }
            start++;
        }
        // System.out.println("ReverseWords.removeSpace returned: sb = [" + sb + "]");
        return sb;
    }

    /**
     * 反转字符串指定区间[start, end]的字符
     */
    public void reverseString(StringBuilder sb, int start, int end) {
        // System.out.println("ReverseWords.reverseString() called with: sb = [" + sb + "], start = [" + start + "], end = [" + end + "]");
        while (start < end) {
            char temp = sb.charAt(start);
            sb.setCharAt(start, sb.charAt(end));
            sb.setCharAt(end, temp);
            start++;
            end--;
        }
        // System.out.println("ReverseWords.reverseString returned: sb = [" + sb + "]");
    }

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

卡码网：55.右旋转字符串

跟之前那个左旋转字符串的思路差不多。先整体翻转，再部分翻转

import java.util.Scanner;

class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int k = in.nextInt();
        in.nextLine(); // consume newline left-over
        String s = in.nextLine();
        String tmp = reverse(s, 0 ,s.length());
        StringBuilder sb = new StringBuilder();
        sb.append(reverse(tmp, 0, k));
        sb.append(reverse(tmp, k, tmp.length()));
        System.out.println(sb);
    }
    
    public static String reverse(String s, int i, int j){
        char[] ch = s.substring(i , j).toCharArray();
        int left = 0;
        int right = ch.length - 1;
        while(left <= right){
            char tmp = ch[right];
            ch[right] = ch[left];
            ch[left] = tmp;
            left++;
            right--;
        }
        return new String(ch);
    }
}