From 52b0757ad4dcca5f6b611db838aae9ee6338a7f6 Mon Sep 17 00:00:00 2001
From: Yuhao Ju <juguaguaji@gmail.com>
Date: Sat, 26 Nov 2022 00:07:59 +0800
Subject: [PATCH] =?UTF-8?q?update=200541.=E5=8F=8D=E8=BD=AC=E5=AD=97?=
 =?UTF-8?q?=E7=AC=A6=E4=B8=B2II=EF=BC=9A=E8=A1=A5=E5=85=85=E6=B3=A8?=
 =?UTF-8?q?=E9=87=8A?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0541.反转字符串II.md | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/problems/0541.反转字符串II.md b/problems/0541.反转字符串II.md
index 59891365..516f78da 100644
--- a/problems/0541.反转字符串II.md
+++ b/problems/0541.反转字符串II.md
@@ -294,6 +294,8 @@ func reverseStr(s string, k int) string {
     ss := []byte(s)
     length := len(s)
     for i := 0; i < length; i += 2 * k {
+     // 1. 每隔 2k 个字符的前 k 个字符进行反转
+     // 2. 剩余字符小于 2k 但大于或等于 k 个，则反转前 k 个字符
         if i + k <= length {
             reverse(ss[i:i+k])
         } else {
@@ -326,7 +328,7 @@ javaScript:
 var reverseStr = function(s, k) {
     const len = s.length;
     let resArr = s.split(""); 
-    for(let i = 0; i < len; i += 2 * k) {
+    for(let i = 0; i < len; i += 2 * k) {  // 每隔 2k 个字符的前 k 个字符进行反转
         let l = i - 1, r = i + k > len ? len : i + k;
         while(++l < --r) [resArr[l], resArr[r]] = [resArr[r], resArr[l]];
     }