-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsort_20.java
More file actions
55 lines (53 loc) · 1.25 KB
/
sort_20.java
File metadata and controls
55 lines (53 loc) · 1.25 KB
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
import java.util.HashMap;
import java.util.Stack;
public class sort_20 {
public static boolean isValid(String s) {
Stack<Character> stack=new Stack<Character>();
HashMap<Character, Character> map=new HashMap<>();
map.put('(',')');
map.put('{','}');
map.put('[',']');
for(int i=0;i<s.length();i++){
if(!stack.isEmpty() && map.get(stack.peek())==s.charAt(i)){
stack.pop();
}
else{
stack.push(s.charAt(i));
}
}
if(stack.isEmpty()){
return true;
}
return false;
}
public static boolean isbracketvalid(String s){
HashMap<Character, Character> map=new HashMap<Character,Character>();
map.put('(',')');
map.put('{', '}');
map.put('[', ']');
Stack<Character> stack=new Stack<>();
for(int i=0;i<s.length();i++){
if(!stack.isEmpty()&&map.containsKey(s.charAt(i))){
if(map.get(stack.peek())==s.charAt(i)){
stack.pop();
}
else{
stack.push(s.charAt(i));
}
}
else{
stack.push(s.charAt(i));
}
}
if(stack.isEmpty()){
return true;
}
else{
return false;
}
}
public static void main(String[] args) {
String aString="([)]";
System.out.println(isbracketvalid(aString));
}
}