码迷,mamicode.com
首页 > 其他好文 > 详细

#Leetcode# 20.Valid Parentheses

时间:2018-11-04 12:50:40      阅读:140      评论:0      收藏:0      [点我收藏+]

标签:solution   closed   als   ble   sam   tar   ems   note   else   

https://leetcode.com/problems/valid-parentheses/description/

 

Given a string 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.

Note that an empty string is also considered valid.

Example 1:

Input: "()"
Output: true

Example 2:

Input: "()[]{}"
Output: true

Example 3:

Input: "(]"
Output: false

Example 4:

Input: "([)]"
Output: false

Example 5:

Input: "{[]}"
Output: true

代码:

class Solution {
public:
    bool isValid(string s) {
        int len = s.length();
        stack<char> Sta;
        for(int i = 0; i <len; i ++) {
            if(s[i] == ‘(‘ || s[i] == ‘[‘ || s[i] == ‘{‘)
                Sta.push(s[i]);
            else {
                if(Sta.empty()) return false;
                if(s[i] == ‘)‘ && Sta.top() != ‘(‘) return false;
                if(s[i] == ‘]‘ && Sta.top() != ‘[‘) return false;
                if(s[i] == ‘}‘ && Sta.top() != ‘{‘) return false;
                Sta.pop();
            }    
        }
        
        if(Sta.empty()) return true;
        else return false;
    }
    
};

  

#Leetcode# 20.Valid Parentheses

标签:solution   closed   als   ble   sam   tar   ems   note   else   

原文地址:https://www.cnblogs.com/zlrrrr/p/9903258.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!