update

yennanliu · Feb 28, 2024 · 83629cb · 83629cb
1 parent 6de37b3
commit 83629cb
Show file tree

Hide file tree

Showing 3 changed files with 44 additions and 36 deletions.
diff --git a/data/progress.txt b/data/progress.txt
@@ -1,3 +1,4 @@
+20240228: 20,21
 20240227: 1,3,5,4,19
 20231218: 57(todo),58(todo),268,61(todo),297
 20231211: 39,53,48,56

diff --git a/data/to_review.txt b/data/to_review.txt
@@ -1,11 +1,18 @@
+2024-04-23 -> ['20,21']
 2024-04-22 -> ['1,3,5,4,19']
+2024-04-02 -> ['20,21']
 2024-04-01 -> ['1,3,5,4,19']
+2024-03-20 -> ['20,21']
 2024-03-19 -> ['1,3,5,4,19']
+2024-03-12 -> ['20,21']
 2024-03-11 -> ['1,3,5,4,19']
+2024-03-07 -> ['20,21']
 2024-03-06 -> ['1,3,5,4,19']
+2024-03-04 -> ['20,21']
 2024-03-03 -> ['1,3,5,4,19']
-2024-03-01 -> ['1,3,5,4,19']
-2024-02-29 -> ['1,3,5,4,19']
+2024-03-02 -> ['20,21']
+2024-03-01 -> ['20,21', '1,3,5,4,19']
+2024-02-29 -> ['20,21', '1,3,5,4,19']
 2024-02-28 -> ['1,3,5,4,19']
 2024-02-11 -> ['57(todo),58(todo),268,61(todo),297']
 2024-02-04 -> ['39,53,48,56']

diff --git a/leetcode_java/src/main/java/LeetCodeJava/Stack/ValidParentheses.java b/leetcode_java/src/main/java/LeetCodeJava/Stack/ValidParentheses.java
@@ -9,6 +9,40 @@
 
 public class ValidParentheses {
 
+    // V0
+    // IDEA : STACK + DICT
+    public boolean isValid(String s) {
+
+        if (s.length() % 2 != 0){
+            return false;
+        }
+
+        HashMap<String, String> map = new HashMap<>();
+        Stack st = new Stack();
+
+        map.put("(", ")");
+        map.put("{", "}");
+        map.put("[", "]");
+
+        for (int i = 0; i < s.length(); i++){
+            String cur = String.valueOf(s.charAt(i));
+            if (st.empty() && !map.containsKey(cur)){
+                return false;
+            }
+            if (map.containsKey(cur)){
+                st.push(cur);
+            }
+            else{
+                String popElement = (String) st.pop();
+                String expect = map.get(popElement);
+                if (!expect.equals(cur)){
+                    return false;
+                }
+            }
+        }
+        return true ? st.empty() : false;
+    }
+
     // V0'
     // IDEA : STACK + add "inverse" Parentheses to stack directly
     // https://www.bilibili.com/video/BV1AF411w78g/?share_source=copy_web&vd_source=771d0eba9b524b4f63f92e37bde71301
@@ -51,40 +85,6 @@ else if (cur.equals("[")){
         return true ? st.empty() : false;
     }
 
-    // V0
-    // IDEA : STACK
-    public boolean isValid(String s) {
-
-        if (s.length() % 2 != 0){
-            return false;
-        }
-
-        HashMap<String, String> map = new HashMap<>();
-        Stack st = new Stack();
-
-        map.put("(", ")");
-        map.put("{", "}");
-        map.put("[", "]");
-
-        for (int i = 0; i < s.length(); i++){
-            String cur = String.valueOf(s.charAt(i));
-            if (st.empty() && !map.containsKey(cur)){
-               return false;
-            }
-            if (map.containsKey(cur)){
-                st.push(cur);
-            }
-            else{
-                String popElement = (String) st.pop();
-                String expect = map.get(popElement);
-                if (!expect.equals(cur)){
-                    return false;
-                }
-            }
-        }
-        return true ? st.empty() : false;
-    }
-
     // V1
     // https://leetcode.com/problems/valid-parentheses/solutions/3398779/python-java-c-simple-solution-video-solution/
     public boolean isValid_1(String s) {