leetcode 541 Reverse String II C++
2017-03-15 23:08
435 查看
这题没什么难的,读懂题就好了,注意k比字符串长和最后剩下的比k小的情况。
string reverseStr(string s, int k) {
int pos = 0;
while(pos < s.size()) {
if (pos + k > s.size()) {
k = s.size() - pos;
}
string tmpStr = s.substr(pos, k);
reverse(tmpStr.begin(), tmpStr.end());
s.replace(pos, k, tmpStr);
pos += 2 * k;
}
return s;
}
string reverseStr(string s, int k) {
int pos = 0;
while(pos < s.size()) {
if (pos + k > s.size()) {
k = s.size() - pos;
}
string tmpStr = s.substr(pos, k);
reverse(tmpStr.begin(), tmpStr.end());
s.replace(pos, k, tmpStr);
pos += 2 * k;
}
return s;
}
相关文章推荐
- LeetCode 541:Reverse String II (c++)
- LeetCode 541. Reverse String II(C++版)
- [leetcode]541. Reverse String II
- LeetCode 541. Reverse String II
- [leetcode]: 541. Reverse String II
- [Leetcode] 541. Reverse String II 解题报告
- Leetcode 541. Reverse String II(Easy)
- leetcode541 Reverse StringII java
- Leetcode #541 Reverse String II
- leetcode -- 541. Reverse String II 【字符串反转 + 双指针 + 状态记录 + 数组与堆内存】
- leetcode 541. Reverse String II(easy)
- LeetCode 541. Reverse String II (字符串翻转)
- LeetCode-541. Reverse String II (Java)
- LeetCode:541. Reverse String II
- LeetCode 541 Reverse String II
- [LeetCode] 344 Reverse String && 541 Reverse String II
- LeetCode 541. Reverse String II (反转字符串 II)
- LeetCode 541 Reverse String II
- [LeetCode]541. Reverse String II(间隔反转字符串)
- The Solution to Leetcode 541 Reverse String II