Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 917 with 22 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 917 # by problem number
lcpy gen -s reverse_only_letters # by problem name
s, reverse the string according to the following rules:
s after reversing it.
Input: s = "ab-cd"
Output: "dc-ba"
Input: s = "a-bC-dEf-ghIj"
Output: "j-Ih-gfE-dCba"
Input: s = "Test1ng-Leet=code-Q!"
Output: "Qedo1ct-eeLg=ntse-T!"
class Solution:
# Time: O(n)
# Space: O(n)
def reverse_only_letters(self, s: str) -> str:
chars = list(s)
left, right = 0, len(chars) - 1
while left < right:
if not chars[left].isalpha():
left += 1
elif not chars[right].isalpha():
right -= 1
else:
chars[left], chars[right] = chars[right], chars[left]
left += 1
right -= 1
return "".join(chars)
| Time | Space |
|---|---|
| O(n) | O(n) |