Day08:344

344. 反转字符串 - 力扣（LeetCode）

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

    }
}

541. 反转字符串 II - 力扣（LeetCode） 

 

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

                start++;
                end--;
            }
        }
        return new String(ch);
}
}

题目页面 

import java.util.Scanner;

class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.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);
    }
}

151. 反转字符串中的单词 - 力扣（LeetCode） 

class Solution {
    public String reverseWords(String s) {
        String[] strs=s.trim().split(" ");
        StringBuilder res=new StringBuilder();
        for(int i=strs.length-1;i>=0;i--){
            if(strs[i].equals(""))
            continue;
            res.append(strs[i]+" ");
        }
        return res.toString().trim();

    }
}