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]

?

2、代碼實現

public class Solution {public String reverse(String s) {if (s == null || s.length() == 0) {return null;}char[] chars = s.toCharArray();int length = chars.length;int start = 0, end = length - 1;while (start < end) {char tmp = chars[start];chars[start++] = chars[end];chars[end--] = tmp;}String result = "";for (char c : chars) result += c;return result;}public String reverseStr(String s, int k) {if (null == s || s.length() == 0)return null;int length = s.length();int one = 1;int count = length % k == 0 ? length / k : length / k + 1;String result = "";for (int i = 1; i <= count; i++) {if (one % 2 == 1)result += reverse(s.substring(k * (i -1), (k * i > length ? length : k * i)));else result += s.substring(k * (i -1), (k * i > length ? length : k * i));one++;}return result;} }
?

3、總結

先把問題化為一小步，分治的思想，比如我們先實現字符串的反轉功能，然后再更具條件來實現，哪些子字符串需要反轉

總結

以上是生活随笔為你收集整理的LeetCode之Reverse String II的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。