From 6cb2076827726fc5be341e226585882424e523e7 Mon Sep 17 00:00:00 2001
From: hs-zhangsan <1513157458@qq.com>
Date: Fri, 18 Feb 2022 17:03:41 +0800
Subject: [PATCH 1/2] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=20541.=E5=8F=8D=E8=BD=AC?=
 =?UTF-8?q?=E5=AD=97=E7=AC=A6=E4=B8=B2II=20C=E8=AF=AD=E8=A8=80=E7=89=88?=
 =?UTF-8?q?=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/0541.反转字符串II.md b/problems/0541.反转字符串II.md
index 14b8601a..bf59f52d 100644
--- a/problems/0541.反转字符串II.md
+++ b/problems/0541.反转字符串II.md
@@ -98,8 +98,31 @@ public:
 
 ## 其他语言版本
 
+C：
+
+```c
+char * reverseStr(char * s, int k){
+    int len = strlen(s);
+
+    for (int i = 0; i < len; i += (2 * k)) {
+        //判断剩余字符是否少于 k
+        k = i + k > len ? len - i : k;
+
+        int left = i;
+        int right = i + k - 1;
+        while (left < right) {
+            char temp = s[left];
+            s[left++] = s[right];
+            s[right--] = temp;
+        }
+    }
+
+    return s;
+}
+```
 
 Java：
+
 ```Java
 //解法一
 class Solution {

From 292fe1eb380622ce4fc19f2d05ef26bb472e855d Mon Sep 17 00:00:00 2001
From: hs-zhangsan <1513157458@qq.com>
Date: Sat, 19 Feb 2022 15:55:31 +0800
Subject: [PATCH 2/2] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=20=E5=89=91=E6=8C=87Offe?=
 =?UTF-8?q?r=2005.=E6=9B=BF=E6=8D=A2=E7=A9=BA=E6=A0=BC=20C=E8=AF=AD?=
 =?UTF-8?q?=E8=A8=80=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/剑指Offer05.替换空格.md | 31 ++++++++++++++++++++++++++
 1 file changed, 31 insertions(+)

diff --git a/problems/剑指Offer05.替换空格.md b/problems/剑指Offer05.替换空格.md
index 530545fb..9e743887 100644
--- a/problems/剑指Offer05.替换空格.md
+++ b/problems/剑指Offer05.替换空格.md
@@ -121,6 +121,37 @@ for (int i = 0; i < a.size(); i++) {
 
 ## 其他语言版本
 
+C：
+```C
+char* replaceSpace(char* s){
+    //统计空格数量
+    int count = 0;
+    int len = strlen(s);
+    for (int i = 0; i < len; i++) {
+        if (s[i] == ' ') {
+            count++;
+        }
+    }
+
+    //为新数组分配空间
+    int newLen = len + count * 2;
+    char* result = malloc(sizeof(char) * newLen + 1);
+    //填充新数组并替换空格
+    for (int i = len - 1, j = newLen - 1; i >= 0; i--, j--) {
+        if (s[i] != ' ') {
+            result[j] = s[i];
+        } else {
+            result[j--] = '0';
+            result[j--] = '2';
+            result[j] = '%';
+        }
+    }
+    result[newLen] = '\0';
+
+    return result;
+}
+```
+
 
 Java：
 ```Java