代码随想录Day08 | Leetcode 344.反转字符串 、Leetcode 541.反转字符串II、Leetcode 54.替换数字、151.翻转字符串里的单词、55.右旋转字符串

344.反转字符串

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

    public void swap(char[] s, int i, int j) {
        char temp = s[i];
        s[i] = s[j];
        s[j] = temp;
    }
}

541.反转字符串II

class Solution {
    public String reverseStr(String s, int k) {
        String[] split = s.split("");
        for (int i = 0; i < split.length / (2 * k) * (2 * k); i = i + 2 * k) {
            swap(split, i, k);
        }
        int begin = split.length / (2 * k) * (2 * k);
        if (split.length - begin < k) {
            swap(split, begin, (split.length - begin) );
        } else {
            swap(split, begin, k);
        }
        StringBuilder stringBuilder = new StringBuilder();
        for (String s1 : split) {
            stringBuilder.append(s1);
        }
        return stringBuilder.toString();
    }

    public void swap(String[] split, int begin, int k) {
        for (int i = begin, j = begin + k - 1; i < j; i++, j--) {
            String temp = split[i];
            split[i] = split[j];
            split[j] = temp;
        }
    }

}

54.替换数字


import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String s = scanner.nextLine();
//        System.out.println("s = " + s);
        String s1 = changeToNumber(s);
//        System.out.println("S1" + s1);
        System.out.println(s1);
    }

    public static String changeToNumber(String s) {
        StringBuilder stringBuilder = new StringBuilder();
        for (int i = 0; i < s.length(); i++) {
            if (s.charAt(i) >= '0' && s.charAt(i) <= '9') {
                stringBuilder.append("number");
            } else {
                stringBuilder.append(s.charAt(i));
            }
        }

        return stringBuilder.toString();
    }

}

151.翻转字符串里的单词

class Solution {
    public String reverseWords(String s) {
        s.trim();
        String[] split = s.split(" ");
        StringBuilder stringBuilder = new StringBuilder();
        for (int i = split.length - 1; i > -1; i--) {
            //("").equals(split[i])需要判断,写成(split[i]).equals("")会报错
            if (!(" ").equals(split[i]) && !("").equals(split[i])) {
                split[i] = split[i].trim();

                stringBuilder.append(split[i]);
                stringBuilder.append(" ");
            }
        }

        return stringBuilder.toString().trim();
    }
}

55.右旋转字符串

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int k = scanner.nextInt();
        String s = scanner.next();
        String s1 = rightReverse(s, k);
        System.out.println(s1);
    }

    public static String rightReverse(String s, int k) {
        String[] split = s.split("");
        StringBuilder stringBuilder = new StringBuilder();
        for (int i = split.length - k; i < split.length; i++) {
            stringBuilder.append(split[i]);
        }
        for (int i = 0; i < split.length - k; i++) {
            stringBuilder.append(split[i]);
        }
        return stringBuilder.toString();
    }
}
  • 6
    点赞
  • 7
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值