LeetCiode--Valid Parentheses

來源:互聯網
上載者:User

標籤:leetcode   string   字串   

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.

Solutions:

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


LeetCiode--Valid Parentheses

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.