541. Reverse String II -- Python

541. Reverse String II

Given a string and an integer k, you need to reverse the first k characters for every 2k characters counting from the start of the string. If there are less than k characters left, reverse all of them. If there are less than 2k but greater than or equal to k characters, then reverse the first k characters and left the other as original.
Example:

Input: s = "abcdefg", k = 2
Output: "bacdfeg"

Restrictions:

• The string consists of lower English letters only.

• Length of the given string and k will in the range [1, 10000]

思路：
因为Python中字符串是不可改变的，所以一个方法是先将字符串转成列表进行操作，或者就是新建一个字符串，然后分不同的段进行相加，组成最后的输出。

代码1:(转成列表)

class Solution:
    def reverseStr(self, s, k):
        """
        :type s: str
        :type k: int
        :rtype: str
        """
        s =list(s)
        for i in range(0,len(s),2*k):
            s[i:i+k]=reversed(s[i:i+k])
        return "".join(s)

代码2：（直接操作）

class Solution:
    def reverseStr(self, s, k):
        """
        :type s: str
        :type k: int
        :rtype: str
        """
        if not s :
            return s
        ans = ''
        for i in range(0, len(s), 2*k):
            '''不支持s[i:i+k:-1]的表达'''
            ans +=s[i:i+k][::-1]
            ans += s[i+k: i+2*k]
        return ans