题目：
题解：
class Solution:
def reverseString(self, s: List[str]) -> None:
"""
Do not return anything, modify s in-place instead.
"""
# 对撞指针
left, right = 0, len(s)-1
while left< right:
if s[left] != s[right]:
s[left], s[right] = s[right], s[left]
left += 1
right -= 1
class Solution:
def reverseString(self, s: List[str]) -> None:
# 递归
def recur(s, left, right):
if left >= right:
return
s[left], s[right] = s[right], s[left]
recur(s, left+1, right-1)
recur(s, 0, len(s))
7081
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
