LeetCode - 541. Reverse String II

最新推荐文章于 2024-02-16 11:01:15 发布

道非凡

最新推荐文章于 2024-02-16 11:01:15 发布

阅读量189

点赞数

文章标签： leetcode

本文链接：https://blog.csdn.net/tianlong1929/article/details/77905680

版权

LeetCode 专栏收录该内容

39 篇文章 0 订阅

订阅专栏

Q：
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:
1. The string consists of lower English letters only.
2. Length of the given string and k will in the range [1, 10000]

A：

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