-
Notifications
You must be signed in to change notification settings - Fork 0
/
GoogleInterviewCodingChallenge11.java
60 lines (56 loc) · 1.79 KB
/
GoogleInterviewCodingChallenge11.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
import java.util.Stack;
public class GoogleInterviewCodingChallenge11 {
public static void main(String[] args) {
/*
* Given a string S containing just the characters '(',')','{','}','[' and ']',
* determine if the input string is valid.
*
* An input string is valid if:
* 1. Open brackets must be closed by the same type of brackets.
* 2. 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 <= 10⁴
* - s consists of parentheses only '()[]{}'.
**/
System.out.println(checkBrackets("()[]{}"));
}
static boolean checkBrackets(String s){
Stack<Character> stack = new Stack<>();
for (int i = 0; i < s.length(); i++) {
if(s.charAt(i) ==')'){
if(stack.size() != 0 && stack.peek() == '(') stack.pop();
else return false;
}else if(s.charAt(i) ==']'){
if(stack.size() != 0 && stack.peek() == '[') stack.pop();
else return false;
}else if(s.charAt(i) =='}'){
if(stack.size() != 0 && stack.peek() == '{') stack.pop();
else return false;
}else{
stack.push(s.charAt(i));
}
}
return stack.isEmpty();
}
}