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]
翻译:给定一个字符串和一个整数k,您需要从字符串开头的每个2k个字符的倒数第k个字符。如果剩下的字符少于k个字符,则反转所有字符。如果小于2k但大于或等于k个字符,则反转前k个字符并将另一个作为原始字符。
例:
输入: s =“abcdefg”,k = 2 输出: “bacdfeg”
限制:
- 该字符串仅由较低的英文字母组成。
- 给定字符串的长度和k将在范围[1,10000]
我的思路:开始想着把字符串转换为字符数组,把字符串数组按2k间隔进行循环,对每个2k区间内再颠倒前k个顺序,循环结束后再处理余下的字符。但实现过于复杂。
答案思路:思路差不多,但是处理很巧妙,也是每2k一个循环,内部循环用j取k-1和length的最小值,一步解决了最后几个字符的问题,这里注意for循环的使用,每个循环变量的取值要考虑清楚,自己还是不够熟悉。
public String reverseStr(String s, int k) {
char[] ca = s.toCharArray();
for(int left = 0;left < ca.length;left += 2*k){
for(int i = left,j = Math.min(i+k-1,ca.length-1);i<j;i++,j--){
char temp = ca[i];
ca[i] = ca[j];
ca[j] = temp;
}
}
return String.valueOf(ca);
}