class Solution:
def reverseStr(self, s: str, k: int) -> str:
s = list(s)
flag = 0
lenght = len(s)
while flag < lenght:
pre = flag
cur = 0
for _ in range(k // 2):
if flag + k > lenght and flag <= lenght - cur - 1:
s[flag], s[lenght - cur - 1] = s[lenght - cur - 1], s[flag]
flag += 1
cur += 1
elif flag > lenght - cur - 1:
break
else:
s[flag + cur], s[flag - cur + k - 1] = s[flag - cur + k - 1], s[flag + cur]
cur += 1
flag = pre + 2 * k
return ''.join(s)
if __name__ == '__main__':
sol = Solution()
print(sol.reverseStr("abcdefg", 1213))
Processed:
0.010, SQL:
12
