[Leetcode] Valid Parentheses

最新推荐文章于 2019-07-31 23:36:17 发布

quansjtu

最新推荐文章于 2019-07-31 23:36:17 发布

阅读量137

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/quansjtu/article/details/52564565

版权

Leetcode 专栏收录该内容

46 篇文章 0 订阅

订阅专栏

Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.

The brackets must close in the correct order, "()" and "()[]{}" are all valid but "(]" and "([)]" are not.

public class Solution {
    public boolean isValid(String s) {
        int len=s.length();
        char[] sym=new char[len]; 
        int count=0;
        for(int i=0;i<len;i++)
        {
            switch (s.charAt(i))
            {
                case '(': 
                    sym[count]='(';
                    count++;
                    break;
                case ')': 
                    count--;
                    if(count<0) return false;
                    if(sym[count]!='(') return false;
                    break;
                case '[': 
                    sym[count]='[';
                    count++;                   
                    break;
                case ']': 
                    count--;
                    if(count<0) return false;
                    if(sym[count]!='[') return false;
                    break;
                case '{': 
                    sym[count]='{';
                    count++;                   
                    break;
                case '}': 
                    count--;
                    if(count<0) return false;
                    if(sym[count]!='{') return false;
                    break;
                default:
                    break;
            }
        }
             if(count!=0) return false;
             else return true;
    }
}