-
Notifications
You must be signed in to change notification settings - Fork 90
/
Remove_Invalid_Parentheses.js
70 lines (58 loc) · 1.44 KB
/
Remove_Invalid_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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
/*
Remove Invalid Parentheses
https://leetcode.com/problems/remove-invalid-parentheses/
Remove the minimum number of invalid parentheses in order to make the input string valid. Return all possible results.
Note: The input string may contain letters other than the parentheses ( and ).
Example 1:
Input: "()())()"
Output: ["()()()", "(())()"]
Example 2:
Input: "(a)())()"
Output: ["(a)()()", "(a())()"]
Example 3:
Input: ")("
Output: [""]
*/
/**
* @param {string} s
* @return {string[]}
*/
var removeInvalidParentheses = function (s) {
var queue = [];
var visited = new Set();
queue.push(s);
var result = [];
var found = false;
while (queue.length !== 0) {
var str = queue.shift();
if (isValid(str)) {
result.push(str);
found = true;
} else if (!found) {
for (var i = 0; i < s.length; i++) {
if (str[i] === "(" || str[i] === ")") {
var subStr = str.slice(0, i) + str.slice(i + 1, s.length);
if (!visited.has(subStr)) {
queue.push(subStr);
visited.add(subStr);
}
}
}
}
}
return result;
};
var isValid = function (s) {
var leftCount = 0;
var iter = 0;
while (iter < s.length) {
if (s[iter] === "(") leftCount++;
else if (s[iter] === ")") {
leftCount--;
if (leftCount < 0) return false;
}
iter++;
}
return leftCount === 0;
};
module.exports.removeInvalidParentheses = removeInvalidParentheses;