Add files via upload

G-WS · web-flow · commit 577dce84a870 · 2022-01-13T11:36:16.000+08:00
diff --git a/20&#12289;&#26377;&#25928;&#30340;&#25324;&#21495;.md b/20&#12289;&#26377;&#25928;&#30340;&#25324;&#21495;.md
@@ -0,0 +1,111 @@
+# 20&#12289;&#26377;&#25928;&#30340;&#25324;&#21495;
+
+&#32473;&#23450;&#19968;&#20010;&#21482;&#21253;&#25324; '('&#65292;')'&#65292;'{'&#65292;'}'&#65292;'['&#65292;']' &#30340;&#23383;&#31526;&#20018; s &#65292;&#21028;&#26029;&#23383;&#31526;&#20018;&#26159;&#21542;&#26377;&#25928;&#12290;
+
+&#26377;&#25928;&#23383;&#31526;&#20018;&#38656;&#28385;&#36275;&#65306;
+
+&#24038;&#25324;&#21495;&#24517;&#39035;&#29992;&#30456;&#21516;&#31867;&#22411;&#30340;&#21491;&#25324;&#21495;&#38381;&#21512;&#12290;
+&#24038;&#25324;&#21495;&#24517;&#39035;&#20197;&#27491;&#30830;&#30340;&#39034;&#24207;&#38381;&#21512;&#12290;
+
+
+&#31034;&#20363; 1&#65306;
+
+```
+&#36755;&#20837;&#65306;s = "()"
+&#36755;&#20986;&#65306;true
+```
+
+
+&#31034;&#20363; 2&#65306;
+
+```
+&#36755;&#20837;&#65306;s = "()[]{}"
+&#36755;&#20986;&#65306;true
+```
+
+
+&#31034;&#20363; 3&#65306;
+
+```
+&#36755;&#20837;&#65306;s = "(]"
+&#36755;&#20986;&#65306;false
+```
+
+
+&#31034;&#20363; 4&#65306;
+
+```
+&#36755;&#20837;&#65306;s = "([)]"
+&#36755;&#20986;&#65306;false
+```
+
+
+&#31034;&#20363; 5&#65306;
+
+```
+&#36755;&#20837;&#65306;s = "{[]}"
+&#36755;&#20986;&#65306;true
+```
+
+
+&#25552;&#31034;&#65306;
+
+1 <= s.length <= 104
+s &#20165;&#30001;&#25324;&#21495; '()[]{}' &#32452;&#25104;
+
+&#26469;&#28304;&#65306;&#21147;&#25187;&#65288;LeetCode&#65289;
+&#38142;&#25509;&#65306;https://leetcode-cn.com/problems/valid-parentheses
+&#33879;&#20316;&#26435;&#24402;&#39046;&#25187;&#32593;&#32476;&#25152;&#26377;&#12290;&#21830;&#19994;&#36716;&#36733;&#35831;&#32852;&#31995;&#23448;&#26041;&#25480;&#26435;&#65292;&#38750;&#21830;&#19994;&#36716;&#36733;&#35831;&#27880;&#26126;&#20986;&#22788;&#12290;
+
+c&#35821;&#35328;&#23454;&#29616;
+
+```c
+bool isValid(char * s){
+    int n = strlen(s);
+    char a[n];
+    int top = 0;
+    a[top]=s[top];
+    for(int i = 1;i<n;i++){
+        top++;
+        a[top]=s[i];
+        if(top==0){continue;}
+        else if(a[top-1]=='('&&a[top]==')'||a[top-1]=='['&&a[top]==']'||a[top-1]=='{'&&a[top]=='}'){
+            top-=2;
+        }
+    }
+    if(top==-1){
+        return true;
+    }else{
+        return false;
+    }
+}
+```
+
+java&#23454;&#29616;
+
+```java
+class Solution {
+    public boolean isValid(String s) {
+        char[] arr = s.toCharArray();
+        int n = arr.length;
+        char []a = new char[n];
+        int top = 0;
+        a[0] = arr[0];
+        for(int i = 1;i<n;){
+            top++;
+            a[top]=arr[i];
+            i++;
+            if(top==0){continue;}
+            else if(a[top-1]=='('&&a[top]==')'||a[top-1]=='['&&a[top]==']'||a[top-1]=='{'&&a[top]=='}'){
+                top-=2;
+            }
+        }
+        if(top==-1){
+            return true;
+        }else{
+            return false;
+        }
+    }
+}
+```
+

-Original file line number
+Diff line change
@@ @@ -0,0 +1,111 @@ @@
 +# 20、有效的括号
++
 +给定一个只包括 '('，')'，'{'，'}'，'['，']' 的字符串 s ，判断字符串是否有效。
++
 +有效字符串需满足：
++
 +左括号必须用相同类型的右括号闭合。
 +左括号必须以正确的顺序闭合。
++
++
 +示例 1：
++
 +```
 +输入：s = "()"
 +输出：true
 +```
++
++
 +示例 2：
++
 +```
 +输入：s = "()[]{}"
 +输出：true
 +```
++
++
 +示例 3：
++
 +```
 +输入：s = "(]"
 +输出：false
 +```
++
++
 +示例 4：
++
 +```
 +输入：s = "([)]"
 +输出：false
 +```
++
++
 +示例 5：
++
 +```
 +输入：s = "{[]}"
 +输出：true
 +```
++
++
 +提示：
++
 +1 <= s.length <= 104
 +s 仅由括号 '()[]{}' 组成
++
 +来源：力扣（LeetCode）
 +链接：https://leetcode-cn.com/problems/valid-parentheses
 +著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。
++
 +c语言实现
++
 +```c
 +bool isValid(char * s){
 +    int n = strlen(s);
 +    char a[n];
 +    int top = 0;
 +    a[top]=s[top];
 +    for(int i = 1;i<n;i++){
 +        top++;
 +        a[top]=s[i];
 +        if(top==0){continue;}
 +        else if(a[top-1]=='('&&a[top]==')'||a[top-1]=='['&&a[top]==']'||a[top-1]=='{'&&a[top]=='}'){
 +            top-=2;
 +        }
 +    }
 +    if(top==-1){
 +        return true;
 +    }else{
 +        return false;
 +    }
 +}
 +```
++
 +java实现
++
 +```java
 +class Solution {
 +    public boolean isValid(String s) {
 +        char[] arr = s.toCharArray();
 +        int n = arr.length;
 +        char []a = new char[n];
 +        int top = 0;
 +        a[0] = arr[0];
 +        for(int i = 1;i<n;){
 +            top++;
 +            a[top]=arr[i];
 +            i++;
 +            if(top==0){continue;}
 +            else if(a[top-1]=='('&&a[top]==')'||a[top-1]=='['&&a[top]==']'||a[top-1]=='{'&&a[top]=='}'){
 +                top-=2;
 +            }
 +        }
 +        if(top==-1){
 +            return true;
 +        }else{
 +            return false;
 +        }
 +    }
 +}
 +```
++