forked from fishercoder1534/Leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path_20.java
28 lines (23 loc) · 1.04 KB
/
_20.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
package com.fishercoder.solutions;
import java.util.Stack;
/**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 _20 {
public boolean isValid(String s) {
Stack<Character> stack = new Stack();
char[] schar = s.toCharArray();
for(int i = 0; i < schar.length; i++){
if(schar[i] == '(' || schar[i] == '[' || schar[i] == '{') stack.push(schar[i]);
else if(schar[i] == ')' || schar[i] == ']' || schar[i] == '}'){
if(stack.isEmpty()) return false;
else {
char pop = stack.pop();
if(schar[i] == ')' && pop != '(') return false;
else if(schar[i] == ']' && pop != '[') return false;
else if(schar[i] == '}' && pop != '{') return false;
}
}
}
return stack.isEmpty();
}
}