-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathvalidParanthesis.java
48 lines (40 loc) · 1.22 KB
/
validParanthesis.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
38
39
40
41
42
43
44
45
46
47
48
// Given a string 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.
// Note that an empty string is also considered valid.
// Example 1:
// Input: "()"
// Output: true
// Example 2:
// Input: "()[]{}"
// Output: true
// Example 3:
// Input: "(]"
// Output: false
class Solution {
public boolean isValid(String s) {
Stack<Character> stack = new Stack<>();
for(int i=0;i<s.length();i++){
char a = s.charAt(i);
if(a=='('||a=='{'||a=='['){
stack.push(a);
}
else{
if(!stack.empty()){
char popped = stack.pop();
if((popped == '(' && a==')') || (popped == '[' && a==']') || (popped == '{' && a=='}'))
continue;
else
return false;
}
else
return false;
}
}
if(!stack.empty())
return false;
else
return true;
}
}