-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathValidParentheses.java
More file actions
30 lines (22 loc) · 886 Bytes
/
Copy pathValidParentheses.java
File metadata and controls
30 lines (22 loc) · 886 Bytes
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
/* 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.
Every close bracket has a corresponding open bracket of the same type.*/
import java.util.Stack;
class Solution {
public boolean isValid(String s) {
Stack<Character> stack=new Stack<Character>();
//create an empty stack
for(char c:s.toCharArray()){
if(c=='(')
stack.push(')');
else if(c=='{')
stack.push('}');
else if(c=='[')
stack.push(']');
else if(stack.isEmpty() || stack.pop()!= c)
return false;
}
return stack.isEmpty();
}}