-
Notifications
You must be signed in to change notification settings - Fork 0
/
validParenthesis.java
59 lines (46 loc) · 1.31 KB
/
validParenthesis.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
49
50
51
52
53
54
55
56
57
58
59
/*
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.
Example 1:
Input: s = "()"
Output: true
Example 2:
Input: s = "()[]{}"
Output: true
Example 3:
Input: s = "(]"
Output: false
Constraints:
1 <= s.length <= 104
s consists of parentheses only '()[]{}'.*/
import java.util.*;
class Solution {
public boolean isValid(String s) {
Stack <Character> s1 = new Stack<Character>();
for(int i = 0;i<s.length();i++){
char c = s.charAt(i);
if(c == '(' || c == '{' || c == '[') {
s1.push(c);
}
else if( c ==')' ) {
if(s1.isEmpty()||s1.pop()!='('){
return false;
}
}
else if( c ==']' ) {
if(s1.isEmpty()||s1.pop()!='['){
return false;
}
}
else if( c =='}' ) {
if(s1.isEmpty()||s1.pop()!='{'){
return false;
}
}
}
return s1.isEmpty();
}
}