-
Notifications
You must be signed in to change notification settings - Fork 46
/
Copy pathvalidParentheses.java
64 lines (46 loc) · 1.42 KB
/
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
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
/*
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.
Example 1:
Input: s = "()"
Output: true
Example 2:
Input: s = "()[]{}"
Output: true
Example 3:
Input: s = "(]"
Output: false
Example 4:
Input: s = "([)]"
Output: false
Example 5:
Input: s = "{[]}"
Output: true
Constraints:
1 <= s.length <= 104
s consists of parentheses only '()[]{}'.
*/
// funtional code
class Solution {
public boolean isValid(String s) {
if (s.length() % 2 != 0) return false;
// create a stack to store parentheses.
Stack<Character> stack = new Stack<>();
for (int i = 0; i < s.length(); i++) {
char c = s.charAt(i);
// push opening parentheses.
if (c == '(') {
stack.push(')');
} else if (c == '[') {
stack.push(']');
} else if (c == '{') {
stack.push('}');
}
// check for coressponding closing parentheses if it is not there then return false.
else if (stack.isEmpty() || stack.pop() != c) return false;
}
// if the stack is empty that means parentheses are valid.
return stack.isEmpty();
}