题目:
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中可以合理使用切片,值得注意的是,python中切片的值可以超出数组长度,并不会报错。
python代码:
class Solution:
def reverseStr(self, s, k):
"""
:type s: str
:type k: int
:rtype: str
"""
result=""
for i in range(0,len(s),2*k):
#python取切片的时候可以取超出范围外
result+=s[i:i+k][::-1]
result+=s[i+k:i+2*k]
return result
c++的话,感觉长度很难判断,很容易runtime error
class Solution {
public:
string reverseStr(string s, int k) {
int j=0;
for (int i=0;i<s.size();i=i+2*k)
{
reverse(s.begin()+i,s.begin()+i+min(k,(int)(s.size()-i)));
}
return s;
}
};
总结:
还是要合理使用库函数啊哈哈哈,之前的答案我都已经看不懂了,不要在指针的操作上面太复杂了。