反转字符串

反转字符串

def reverseString(s: list[str]) -> None:
    left = 0
    right = len(s) - 1
    for i in range(len(s) // 2):
        s[left],s[right] = s[right],s[left]
        left += 1
        right -= 1
    return s

或者直接 return s.reverse()
要求是在原列表基础上改

反转字符串 Ⅱ

def reverseStr(s: str, k: int) -> str:
    res = ''
    t = [s[i:i + 2 * k] for i in range(0,len(s),2 * k)]
    print(t)
    for i in range(len(t)):
        t[i] = t[i][:k][::-1] + t[i][k:]
        res += t[i]
    return res

s = "abcdat"
k = 2
print(reverseStr(s,k))

反转字符

def reverseWords(s: str) -> str:
    t = s.split()[::-1]
    return ''.join(i + ' ' for i in t)[:-1]

s = "the sky is blue"
print(reverseWords(s))

或者:

def reverseWords(s: str) -> str:
    s = s.strip()
    s = s[::-1]
    return ' '.join(word[::-1] for word in s.split())

找出字符串中第一个匹配项的下标

为find量身定做

def strStr(haystack: str, needle: str) -> int:
    return haystack.find(needle)

或者：

def strStr(haystack: str, needle: str) -> int:
    length1 = len(haystack)
    length2 = len(needle)
    for i in range(length1 - length2 + 1):
        if haystack[i] == needle[0]:
            if haystack[i:i + length2] == needle:
                return i