From 42c1bb2db38aadaf58894841f0bd1e836f273b81 Mon Sep 17 00:00:00 2001
From: huangge1199 <huangge1199@hotmail.com>
Date: Wed, 31 Mar 2021 14:20:58 +0800
Subject: [PATCH] =?UTF-8?q?=E5=8A=9B=E6=89=A3=EF=BC=9A20:=E6=9C=89?=
 =?UTF-8?q?=E6=95=88=E7=9A=84=E6=8B=AC=E5=8F=B7?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../leetcode/editor/cn/ValidParentheses.java  | 98 +++++++++++++++++++
 1 file changed, 98 insertions(+)
 create mode 100644 LeetCode/src/main/java/leetcode/editor/cn/ValidParentheses.java

diff --git a/LeetCode/src/main/java/leetcode/editor/cn/ValidParentheses.java b/LeetCode/src/main/java/leetcode/editor/cn/ValidParentheses.java
new file mode 100644
index 0000000..4aed940
--- /dev/null
+++ b/LeetCode/src/main/java/leetcode/editor/cn/ValidParentheses.java
@@ -0,0 +1,98 @@
+//给定一个只包括 '('，')'，'{'，'}'，'['，']' 的字符串 s ，判断字符串是否有效。 
+//
+// 有效字符串需满足： 
+//
+// 
+// 左括号必须用相同类型的右括号闭合。 
+// 左括号必须以正确的顺序闭合。 
+// 
+//
+// 
+//
+// 示例 1： 
+//
+// 
+//输入：s = "()"
+//输出：true
+// 
+//
+// 示例 2： 
+//
+// 
+//输入：s = "()[]{}"
+//输出：true
+// 
+//
+// 示例 3： 
+//
+// 
+//输入：s = "(]"
+//输出：false
+// 
+//
+// 示例 4： 
+//
+// 
+//输入：s = "([)]"
+//输出：false
+// 
+//
+// 示例 5： 
+//
+// 
+//输入：s = "{[]}"
+//输出：true 
+//
+// 
+//
+// 提示： 
+//
+// 
+// 1 <= s.length <= 104 
+// s 仅由括号 '()[]{}' 组成 
+// 
+// Related Topics 栈 字符串 
+// 👍 2289 👎 0
+
+package leetcode.editor.cn;
+
+import java.util.HashMap;
+import java.util.Map;
+import java.util.Stack;
+
+//20:有效的括号
+public class ValidParentheses {
+    public static void main(String[] args) {
+        //测试代码
+        Solution solution = new ValidParentheses().new Solution();
+        solution.isValid("()");
+    }
+
+    //力扣代码
+    //leetcode submit region begin(Prohibit modification and deletion)
+    class Solution {
+        public boolean isValid(String s) {
+            Stack<String> stack = new Stack<>();
+            int length = s.length();
+            if (length % 2 == 1) {
+                return false;
+            }
+            Map<String, String> map = new HashMap<String, String>() {
+                {
+                    put(")", "(");
+                    put("}", "{");
+                    put("]", "[");
+                }
+            };
+            for (int i = 0; i < length; i++) {
+                String ch = s.substring(i, i + 1);
+                if (!map.containsKey(ch) || stack.isEmpty() || !map.get(ch).equals(stack.pop())) {
+                    stack.push(ch);
+                }
+            }
+            return stack.isEmpty();
+        }
+    }
+//leetcode submit region end(Prohibit modification and deletion)
+
+}
\ No newline at end of file