import java.util.Stack;
class Solution {
public boolean isValid(String s) {
int i = 0;
int length = s.length();
if(length==1){
return false;
}
if(length==0){
return true;
}
Stack<Character> left = new Stack();
//Stack<Integer> fight = new Stack();
for( i=0 ; i<length ;i++){
char c = s.charAt(i);
if( c == '(' || c == '{' || c == '[' ){
left.push(c);
}
if( c == ')'){
if(left.empty()){
return false;
}
if(left.pop()!='('){
System.out.println(c);
return false;
}
}
if(c == '}'){
if(left.empty()){
return false;
}
if(left.pop()!='{'){
return false;
}
}
if(c == ']'){
if(left.empty()){
return false;
}
if(left.pop()!='['){
return false;
}
}
}
if(!left.empty() && i == length){
return false;
}
return true;
}
}
20. 有效的括号
最新推荐文章于 2022-12-07 11:27:56 发布