思路:双指针,分别从头尾开始,向中间移动,每次都将所指元素进行交换
class Solution:
def reverseString(self, s: List[str]) -> None:
"""
Do not return anything, modify s in-place instead.
"""
n = len(s)
i, j = 0, n - 1
while i < j:
s[i], s[j] = s[j], s[i]
i += 1
j -= 1
return
笔记:python中不会有超出数组的问题,直接反转就可以
代码:
class Solution:
def reverseStr(self, s: str, k: int) -> str:
def reverse(text):
i = 0
j = len(text) - 1
while i < j:
text[i], text[j] = text[j], text[i]
i += 1
j -= 1
return text
res = list(s)
n = len(s)
for i in range(0, n, 2*k):
res[i : i + k] = reverse(res[i : i + k])
return ''.join(res)
class Solution:
def replaceSpace(self, s: str) -> str:
counter = s. count(' ')
res = list(s)
res.extend([' '] * counter * 2)
l, r = len(s) - 1, len(res) - 1
while l >= 0:
if res[l] != ' ':
res[r] = res[l]
r -= 1
else:
res[r] = '0'
res[r - 1] = '2'
res[r - 2] = '%'
r -= 3
l -= 1
return ''.join(res)
思路:先去除多余空格,再翻转整个字符串,再分别翻转每个单词
思路:
- 反转区间为前n的子串
- 反转区间为n到末尾的子串
- 反转整个字符串
class Solution:
def reverseLeftWords(self, s: str, n: int) -> str:
s = list(s)
s[0:n] = list(reversed(s[0:n]))
s[n:] = list(reversed(s[n:]))
s.reverse()
return ''.join(s)