Leetcode 344 Reverse String

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

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/reverse-string
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

思路解析

• 将列表元素前后两两对换

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

时间复杂度为$O(N)$，空间复杂度为$O(1)$

• 上面的思路也可以用双指针来实现

class Solution:
    def reverseString(self, s: List[str]) -> None:
        """
        Do not return anything, modify s in-place instead.
        """
        length = len(s)
        if length < 2:
            return
        i = 0
        j = length - 1
        while i < j:
            s[i], s[j] = s[j], s[i]
            i += 1
            j -= 1