Leetcode #541 Reverse String II

Description

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.

Note

  • The string consists of lower English letters only.
  • Length of the given string and k will in the range [1, 10000]

Example

Input: s = “abcdefg”, k = 2
Output: “bacdfeg”

Code

class Solution(object):
    def reverseStr(self, s, k):
        """
        :type s: str
        :type k: int
        :rtype: str
        """
        s_len = len(s)
        ans = ""
        for i in range(0, s_len, 2 * k):
            if i == 0:
                ans += s[i+k-1::-1]
            else:
                ans += s[i+k-1:i-1:-1]
            ans += s[i+k:i+2*k]
        return ans
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值