[leetcode]: 541. Reverse String II
来源:互联网 发布:淘宝2017双十一 编辑:程序博客网 时间:2024/05/18 02:56
1.题目
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]
翻译:翻转字符串s,参数k,每2k个字符,翻转前k个。如果最后剩下的字符数大于等于k小于2k,翻转前k个。否则不做操作。
2.分析
STL函数reverse
3.代码
string reverseStr(string s, int k) { if (k <= 1) return s; for (int i = 0; i < s.size(); i += 2 * k) reverse(s.begin() + i, min(s.begin() + i + k, s.end())); return s;}
阅读全文
0 0
- leetcode 541. Reverse String II
- Leetcode-541. Reverse String II
- 【Leetcode】541. Reverse String II
- 541. Reverse String II LeetCode
- [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
- [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
- leetcode 541. Reverse String II
- LeetCode-541. Reverse String II
- [LeetCode] 541. Reverse String II
- LeetCode 541. Reverse String II
- Shell常用语法归集
- Struts2 Namespace_命名空间
- linux运维-bond
- AndroidStudio 2.2以及以上版本 或 Gradle 2.2以及以上 版本V2签名与打渠道包冲突
- C 语言的HelloWorld(printf用法详解)
- [leetcode]: 541. Reverse String II
- 三分法求凸性函数极大极小值
- NYoj 33 蛇形填数
- 剑指offer----字符流中第一个不重复的字符
- LeetCode 31. Next Permutation
- TUTORIAL: MEASURING REVERBERATION TIME
- 原码、反码、补码
- 开发Hive自定义UDF,生成16位时间
- java多线程二(synchronized与volatile)