Java实现字符串反转【Leetcode】

最新推荐文章于 2022-04-26 11:28:12 发布

转载最新推荐文章于 2022-04-26 11:28:12 发布 · 218 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/leonwen/p/10479794.html

文章标签：

#java

本文介绍了一种在不使用额外空间的情况下，对字符数组进行原地反转的算法。通过一个简单的for循环和字符交换操作，实现字符串的逆序排列，适用于如['h','e','l','l','o']和['H','a','n','n','a','h']等输入。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Write a function that reverses a string. The input string is given as an array of characters char[].
Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.
You may assume all the characters consist of printable ascii characters.
Example 1:
Input: ["h","e","l","l","o"]
Output: ["o","l","l","e","h"]
Example 2:
Input: ["H","a","n","n","a","h"]
Output: ["h","a","n","n","a","H"]

class Solution {
    public void reverseString(char[] s) {
        for (int i = 0;i < s.length;i++) {
            int k = s.length - i - 1;
            if (k < s.length / 2) break;
            char ch = s[i];
            s[i] = s[k];
            s[k] = ch;
        }
    }
}

public class ReverseString {
    public static void main(String[] args) {
        String str = "hello";
//        StringBuilder sb = new StringBuilder(str);
//        String re = sb.reverse().toString(); /// StringBuilder有reverse方法
        char[] s = str.toCharArray();
//        String tp  = String.valueOf(t);
        Solution solution = new Solution();
        solution.reverseString(s);
    }
}

转载于:https://www.cnblogs.com/leonwen/p/10479794.html