代码随想录Day8|字符串1

344.反转字符串[简单题]

• 双指针反转，交换位置

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):
            s[left],s[right]=s[right],s[left]
            left += 1
            right -= 1
        return ''.join(s)

541. 反转字符串II[简单题]

• V1 自己写的循环思路需要再精简一些
• V2 精简版参考

# V1
class Solution:
    def reverseStr(self, s: str, k: int) -> str:
        def reverse(s,left,right):
            while(left<right):
                s[left],s[right] = s[right],s[left]
                left += 1
                right -= 1
            return s
        n = len(s)
        s = list(s)
        for i in range(n//(2*k)):
            s = reverse(s,i*2*k,i*2*k+k-1)
        reminder = n%(2*k)
        s = reverse(s,n-reminder,n-1) if reminder<k else reverse(s,n-reminder,n-reminder+k-1)
        return ''.join(s)

# V2
class Solution:
    def reverseStr(self, s: str, k: int) -> str:
        def reverse(text):
            left,right = 0,len(text)-1
            while(left<right):
                text[left],text[right] = text[right],text[left]
                left += 1
                right -= 1
            return text
        n = len(s)
        s = list(s)
        for i in range(0, n, 2*k):
            s[i:i+k] = reverse(s[i:i+k]) # 列表切片超限不会报错
        return ''.join(s)

剑指Offer 05.替换空格[简单题]

• 常用字符串操作 ① " “.join(s) ② s.replace(” “,”%20") ③ s.count(" “)计数空格 ④ “%20”.join(s.split(” "))
• 本题可扩展数组用双指针，时间关系暂时没写

class Solution:
    def replaceSpace(self, s: str) -> str:
        s = list(s)
        for ind,i in enumerate(s):
            s[ind] = '%20' if i == ' ' else s[ind]
        return ''.join(s)

151.翻转字符串里的单词[中等题]

• 思路一：调用现成函数（注意s.split()和s.split(" ")的区别，后者不删除前后空格）
• 思路二：先反转所有字符，再翻转词语，最后删除多余空格。暂时没写

# V1
class Solution:
    def reverseWords(self, s: str) -> str:
        return ' '.join(s.split()[::-1])

剑指Offer58-II.左旋转字符串

• 思路：翻转全部，再部分翻转【反过来好像也可以】

class Solution:
    def reverseLeftWords(self, s: str, n: int) -> str:
        def reverse(text):
            left,right = 0,len(text)-1
            while(left<right):
                text[left],text[right] = text[right],text[left]
                left += 1
                right -= 1
            return text
        
        res = list(s)
        N = len(res)
        res = reverse(res)
        res = reverse(res[:N-n])+reverse(res[N-n:])
        return ''.join(res)