From 52750d3a17c85ba006eed636f2fd33b6089dd9fa Mon Sep 17 00:00:00 2001
From: Guanzhong Pan <gpan20020205@gmail.com>
Date: Thu, 25 Nov 2021 11:59:19 +0000
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=200020.=E6=9C=89=E6=95=88?=
 =?UTF-8?q?=E7=9A=84=E6=8B=AC=E5=8F=B7.md=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/0020.有效的括号.md | 41 ++++++++++++++++++++++++++++++++
 1 file changed, 41 insertions(+)

diff --git a/problems/0020.有效的括号.md b/problems/0020.有效的括号.md
index 57aa5a01..6c6f0cb7 100644
--- a/problems/0020.有效的括号.md
+++ b/problems/0020.有效的括号.md
@@ -283,6 +283,47 @@ var isValid = function(s) {
 };
 ```
 
+C:
+```C
+//辅助函数：判断栈顶元素与输入的括号是否为一对。若不是，则返回False
+int notMatch(char par, char* stack, int stackTop) {
+    switch(par) {
+        case ']':
+            return stack[stackTop - 1] != '[';
+        case ')':
+            return stack[stackTop - 1] != '(';
+        case '}':
+            return stack[stackTop - 1] != '{';
+    }
+    return 0;
+}
+
+bool isValid(char * s){
+    int strLen = strlen(s);
+    //开辟栈空间
+    char stack[5000];
+    int stackTop = 0;
+
+    //遍历字符串
+    int i;
+    for(i = 0; i < strLen; i++) {
+        //取出当前下标所对应字符
+        char tempChar = s[i];
+        //若当前字符为左括号，则入栈
+        if(tempChar == '(' || tempChar == '[' || tempChar == '{')
+            stack[stackTop++] = tempChar;
+        //若当前字符为右括号，且栈中无元素或右括号与栈顶元素不符，返回False
+        else if(stackTop == 0 || notMatch(tempChar, stack, stackTop))
+            return 0;
+        //当前字符与栈顶元素为一对括号，将栈顶元素出栈
+        else
+            stackTop--;
+    }
+    //若栈中有元素，返回False。若没有元素（stackTop为0），返回True
+    return !stackTop;
+}
+```
+
 
 -----------------------
 <div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>