-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path2.valid-parentheses.js
45 lines (39 loc) · 1.03 KB
/
2.valid-parentheses.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
// https://leetcode.com/problems/valid-parentheses/
// Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
// An input string is valid if:
// Open brackets must be closed by the same type of brackets.
// Open brackets must be closed in the correct order.
// Example 1:
// Input: s = "()"
// Output: true
// Example 2:
// Input: s = "()[]{}"
// Output: true
// Example 3:
// Input: s = "(]"
// Output: false
// Constraints:
// 1 <= s.length <= 104
// s consists of parentheses only '()[]{}'.
/**
* @param {string} s
* @return {boolean}
*/
var isValid = function (s) {
const map = new Map();
map.set('{', '}');
map.set('(', ')');
map.set('[', ']');
const b = [];
for (let i = 0; i < s.length; i++) {
if (map.has(s.charAt(i))) {
b.push(s.charAt(i));
} else {
let pop = b.pop();
if (map.get(pop) !== s.charAt(i)) {
return false;
}
};
};
return b.length === 0;
};