训练营第八天 Leetcode 344 541 151 卡码网 54 55

最新推荐文章于 2024-10-01 05:04:32 发布

xerx33

最新推荐文章于 2024-10-01 05:04:32 发布

阅读量374

点赞数 11

文章标签： leetcode 算法

本文链接：https://blog.csdn.net/xerx33/article/details/136725714

版权

本文详细介绍了如何在Java中通过多种方式处理字符串，包括反转字符串、使用StringBuilder进行操作以及处理数字替换。重点展示了Solution类中的reverseString方法及其在main方法中的应用实例。

摘要由CSDN通过智能技术生成

344

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

541

class Solution {
    public String reverseStr(String s, int k) {
        char[] c = s.toCharArray();
        for(int i = 0; i < c.length; i += (2*k)){
            if(i + k > c.length - 1){
                reverse(c, i, c.length - 1);
                break;
            }else{
                reverse(c, i, i + k - 1);
            }
        }
        return new String(c);
    }
    public void reverse(char[] s, int l, int r) {
        while(l < r){
            char temp = s[l];
            s[l] = s[r];
            s[r] = temp;
            l++;
            r--;
        }
    }
}

151

class Solution {
    public String reverseWords(String s) {
        String noSpace = removeSpace(s);
        char[] str = noSpace.toCharArray();
        reverseString(str, 0, str.length - 1);
        int l = 0;
        for(int i = 0; i <= str.length; i++){
            if(i == str.length || str[i] == ' '){
                reverseString(str, l, i - 1);
                l = i + 1;
            }
        }
        return new String(str);
    }
    public String removeSpace(String 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.toString();
    }
    public void reverseString(char[] s, int l, int r) {
        while(l < r){
            char temp = s[l];
            s[l] = s[r];
            s[r] = temp;
            l++;
            r--;
        }
    }
}

卡码网 54

import java.util.Scanner;
class Main{
    public static String changeNumber(String s){
        StringBuilder str = new StringBuilder(s);
        for(int i = 0; i < str.length(); i++){
            if(Character.isDigit(str.charAt(i))){
                str.replace(i, i+1, "number");
            }
        }
        return str.toString();
    }
    
    public static void main(String[] args){
        Scanner in = new Scanner(System.in);
        String s = in.nextLine();
        System.out.println(changeNumber(s));
    }
}

卡码网 55

import java.util.Scanner;
class Main{
    public static void reverseString(char[] s, int l, int r) {
        while(l < r){
            char temp = s[l];
            s[l] = s[r];
            s[r] = temp;
            l++;
            r--;
        }
    }
    public static void main(String[] args){
        Scanner in = new Scanner(System.in);
        int k = Integer.parseInt(in.nextLine());
        String s = in.nextLine();
        char[] str = s.toCharArray();
        reverseString(str, 0, str.length - 1);
        reverseString(str, 0, k - 1);
        reverseString(str, k, str.length - 1);
        System.out.println(str);
    }
}

字符串主要是模拟，写倒是不难，但是java写要转成char[] 或者Stringbuilder，或者两个都要，会有点麻烦