时间:2020-6-23
题目地址:https://leetcode-cn.com/problems/reverse-string/
题目难度:Easy
题目描述:
编写一个函数,其作用是将输入的字符串反转过来。输入字符串以字符数组 char[] 的形式给出。
不要给另外的数组分配额外的空间,你必须原地修改输入数组、使用 O(1) 的额外空间解决这一问题。
你可以假设数组中的所有字符都是 ASCII 码表中的可打印字符。
示例 1:
输入:["h","e","l","l","o"]
输出:["o","l","l","e","h"]
示例 2:
输入:["H","a","n","n","a","h"]
输出:["h","a","n","n","a","H"]
思路1:双指针
代码段1:通过
class Solution:
def reverseString(self, s: List[str]) -> None:
"""
Do not return anything, modify s in-place instead.
"""
number = len(s)
for i in range(number // 2):
s[i], s[number - 1 - i] = s[number - 1 - i], s[i]
总结:
- 双指针不赖,有直接用reverse() 、[::-1]的,6啊
思路2:递归
代码段2:通过
class Solution:
def reverseString(self, s: List[str]) -> None:
"""
Do not return anything, modify s in-place instead.
"""
def helper(left, right):
if left < right:
s[left], s[right] = s[right], s[left]
helper(left + 1, right - 1)
helper(0, len(s) - 1)
总结:
- 感觉递归有点大材小用了
思路3:一步法
代码段3:通过
class Solution:
def reverseString(self, s: List[str]) -> None:
"""
Do not return anything, modify s in-place instead.
"""
s[:] = s[::-1]
总结:
- 切片厉害了