【Leetcode】344. Reverse String

最新推荐文章于 2024-01-01 10:31:38 发布

原创最新推荐文章于 2024-01-01 10:31:38 发布 · 206 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

leetcode 专栏收录该内容

31 篇文章

订阅专栏

本文深入讲解了字符串反转的实现方法，使用Java和Python代码演示如何在不使用额外空间的情况下，通过修改输入数组来完成字符串的反转操作。文章提供了详细的代码示例，并解释了算法的工作原理。

344. Reverse String

Easy

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

数组翻转

只需要将数组前一半和后面一半进行交换即可

Java

class Solution {
    public void reverseString(char[] s) {
        if(s == null || s.length == 0) return;
        int len = s.length/2;
        for(int i=0; i<len; i++){
            char temp = s[s.length-1-i];
            s[s.length-1-i] = s[i];
            s[i] = temp;
        }
    }
}

Python

class Solution:
    def reverseString(self, s: List[str]) -> None:
        """
        Do not return anything, modify s in-place instead.
        """
        len_ = len(s)//2
        for i in range(len_):
            s[len(s)-1-i], s[i] = s[i], s[len(s)-1-i]
        return s