-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path20_ValidParentheses.java
37 lines (35 loc) · 1.29 KB
/
20_ValidParentheses.java
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
/*
* Given a string containing just the characters '(', ')', '{',
* '}', '[' and ']', determine if the input string is valid.
* The brackets must close in the correct order, "()" and
* "()[]{}" are all valid but "(]" and "([)]" are not.
*/
public class Solution {
public boolean isValid(String s) {
Stack<Character> stack = new Stack<Character>();
for(int i=0; i<s.length(); i++) {
char ch = s.charAt(i);
if(ch == '(' || ch == '[' || ch == '{')
stack.push(ch);
if(ch == ')' && (stack.isEmpty() || stack.pop() != '('))
return false;
if(ch == ']' && (stack.isEmpty() || stack.pop() != '['))
return false;
if(ch == '}' && (stack.isEmpty() || stack.pop() != '{'))
return false;
}
if(!stack.isEmpty()) return false;
return true;
}
}
//
public boolean isValid(String s) {
Stack<Character> stack = new Stack<Character>();
for (int i = 0; i < s.length(); i++) {
if (s.charAt(i) == '(' || s.charAt(i) == '[' || s.charAt(i) == '{')
stack.push(s.charAt(i));
else if (stack.isEmpty() || s.charAt(i) - stack.pop() > 2)
return false;
}
return stack.isEmpty();
}