From 3651d52d2e754de07e214ef4031556660b3ed624 Mon Sep 17 00:00:00 2001
From: huangge1199 <huangge1199@hotmail.com>
Date: Thu, 12 Aug 2021 11:38:02 +0800
Subject: [PATCH] =?UTF-8?q?541:=E5=8F=8D=E8=BD=AC=E5=AD=97=E7=AC=A6?=
 =?UTF-8?q?=E4=B8=B2=20II?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../leetcode/editor/cn/ReverseStringIi.java   | 63 +++++++++++++++++++
 .../leetcode/editor/cn/ReverseStringIi.md     | 33 ++++++++++
 2 files changed, 96 insertions(+)
 create mode 100644 src/main/java/leetcode/editor/cn/ReverseStringIi.java
 create mode 100644 src/main/java/leetcode/editor/cn/ReverseStringIi.md

diff --git a/src/main/java/leetcode/editor/cn/ReverseStringIi.java b/src/main/java/leetcode/editor/cn/ReverseStringIi.java
new file mode 100644
index 0000000..ed9f61b
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/ReverseStringIi.java
@@ -0,0 +1,63 @@
+//给定一个字符串 s 和一个整数 k，从字符串开头算起，每 2k 个字符反转前 k 个字符。 
+//
+// 
+// 如果剩余字符少于 k 个，则将剩余字符全部反转。 
+// 如果剩余字符小于 2k 但大于或等于 k 个，则反转前 k 个字符，其余字符保持原样。 
+// 
+//
+// 
+//
+// 示例 1： 
+//
+// 
+//输入：s = "abcdefg", k = 2
+//输出："bacdfeg"
+// 
+//
+// 示例 2： 
+//
+// 
+//输入：s = "abcd", k = 2
+//输出："bacd"
+// 
+//
+// 
+//
+// 提示： 
+//
+// 
+// 1 <= s.length <= 104 
+// s 仅由小写英文组成 
+// 1 <= k <= 104 
+// 
+// Related Topics 双指针 字符串 
+// 👍 139 👎 0
+
+package leetcode.editor.cn;
+
+//541:反转字符串 II
+class ReverseStringIi {
+    public static void main(String[] args) {
+        //测试代码
+        Solution solution = new ReverseStringIi().new Solution();
+    }
+
+    //力扣代码
+    //leetcode submit region begin(Prohibit modification and deletion)
+    class Solution {
+        public String reverseStr(String s, int k) {
+            char[] a = s.toCharArray();
+            for (int start = 0; start < a.length; start += 2 * k) {
+                int i = start, j = Math.min(start + k - 1, a.length - 1);
+                while (i < j) {
+                    char tmp = a[i];
+                    a[i++] = a[j];
+                    a[j--] = tmp;
+                }
+            }
+            return new String(a);
+        }
+    }
+//leetcode submit region end(Prohibit modification and deletion)
+
+}
\ No newline at end of file
diff --git a/src/main/java/leetcode/editor/cn/ReverseStringIi.md b/src/main/java/leetcode/editor/cn/ReverseStringIi.md
new file mode 100644
index 0000000..a98a9b8
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/ReverseStringIi.md
@@ -0,0 +1,33 @@
+<p>给定一个字符串 <code>s</code> 和一个整数 <code>k</code>，从字符串开头算起，每 <code>2k</code> 个字符反转前 <code>k</code> 个字符。</p>
+
+<ul>
+	<li>如果剩余字符少于 <code>k</code> 个，则将剩余字符全部反转。</li>
+	<li>如果剩余字符小于 <code>2k</code> 但大于或等于 <code>k</code> 个，则反转前 <code>k</code> 个字符，其余字符保持原样。</li>
+</ul>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre>
+<strong>输入：</strong>s = "abcdefg", k = 2
+<strong>输出：</strong>"bacdfeg"
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre>
+<strong>输入：</strong>s = "abcd", k = 2
+<strong>输出：</strong>"bacd"
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= s.length &lt;= 10<sup>4</sup></code></li>
+	<li><code>s</code> 仅由小写英文组成</li>
+	<li><code>1 &lt;= k &lt;= 10<sup>4</sup></code></li>
+</ul>
+<div><div>Related Topics</div><div><li>双指针</li><li>字符串</li></div></div>\n<div><li>👍 139</li><li>👎 0</li></div>
\ No newline at end of file