LeetCode 20
class Solution {
public boolean isValid(String s) {
if(s.length()<=1){
return false;
}
Map<Character,Character> smap= new HashMap<>();
smap.put('(',')');
smap.put('{','}');
smap.put('[',']');
Stack<Character> stack =new Stack<>();
for(int i=0;i<s.length();i++){
char item = s.charAt(i);
if(smap.containsKey(item)){
stack.push(item);
}else{
if(!stack.isEmpty()){
Character left = stack.pop();
char rightchar = smap.get(left);
if(rightchar !=item){
return false;
}
}else{
return false;
}
}
}
return stack.isEmpty();
}
}