feat: update 20-is-valid

YanceyOfficial · Sep 1, 2023 · db20b75 · db20b75
1 parent d8ab80d
commit db20b75
Show file tree

Hide file tree

Showing 3 changed files with 7 additions and 8 deletions.
diff --git a/leetcode-docs/easy/20-is-valid.mdx b/leetcode-docs/easy/20-is-valid.mdx
@@ -67,9 +67,9 @@ var isValid = function (s) {
     } else {
       const top = stack[stack.length - 1]
 
-      if (top === '{' && s[i] === '}') stack.pop()
-      else if (top === '[' && s[i] === ']') stack.pop()
-      else if (top === '(' && s[i] === ')') stack.pop()
+      if (top === '{' && ch === '}') stack.pop()
+      else if (top === '[' && ch === ']') stack.pop()
+      else if (top === '(' && ch === ')') stack.pop()
       else return false
     }
   }

diff --git a/leetcode-docs/hard/32-longest-valid-parentheses.mdx b/leetcode-docs/hard/32-longest-valid-parentheses.mdx
@@ -51,8 +51,7 @@ var longestValidParentheses = function (s) {
 
   let max = 0
   for (let i = 0; i < n; i++) {
-    const curr = s[i]
-    if (curr === '(') {
+    if (s[i] === '(') {
       stack.push(i)
     } else {
       stack.pop()

diff --git a/src/leetcode/javascript/easy/20.有效的括号.js b/src/leetcode/javascript/easy/20.有效的括号.js
@@ -20,9 +20,9 @@ var isValid = function (s) {
       stack.push(ch)
     } else {
       const top = stack[stack.length - 1]
-      if (top === '{' && s[i] === '}') stack.pop()
-      else if (top === '[' && s[i] === ']') stack.pop()
-      else if (top === '(' && s[i] === ')') stack.pop()
+      if (top === '{' && ch === '}') stack.pop()
+      else if (top === '[' && ch === ']') stack.pop()
+      else if (top === '(' && ch === ')') stack.pop()
       else return false
     }
   }