LeetCode 344.Reverse String

最新推荐文章于 2024-10-30 14:13:12 发布

原创最新推荐文章于 2024-10-30 14:13:12 发布 · 114 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 同时被 2 个专栏收录

35 篇文章

订阅专栏

LeetCode — dfs

18 篇文章

订阅专栏

本文介绍了一种在不使用额外空间的情况下，逆序字符串的方法。通过递归调用，交换输入字符数组两端的元素，实现了字符串的逆序。此方法避免了创建新的数组，仅使用O(1)的额外内存完成了任务。

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

Reverse String

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"]

解题思路

本题时候用普通的迭代也可以，dfs更简洁一点吧（注意的就是别反向输出，题目要求改变数组的元素位置）

解题代码

class Solution {
    public void reverseString(char[] s) {
        s = helper(0, s);
    }
    public char[] helper(int index, char[] s){
        if (s == null || index == s.length / 2) return s;
        char t = s[index];
        s[index] = s[s.length - 1 - index];
        s[s.length - 1 - index] = t;
        return helper(index + 1, s);
    }
}