leetcode20-Valid Parentheses

最新推荐文章于 2022-02-10 13:47:19 发布

原创最新推荐文章于 2022-02-10 13:47:19 发布 · 477 阅读

0 ·

CC 4.0 BY-SA版权

C++ 同时被 2 个专栏收录

26 篇文章

订阅专栏

Leetcode

10 篇文章

订阅专栏

本文介绍了一种用于判断括号字符串是否有效的算法，通过使用栈数据结构来确保括号的正确闭合顺序。

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.

class Solution {
public:
    bool isValid(string s) {
        vector<char> stackChar;
		for(int i=0;i<s.size();i++)
		{
			if(stackChar.size()==0)
				stackChar.push_back(s[i]);
			else if(s[i]+stackChar.back()=='('+')'||s[i]+stackChar.back()=='['+']'||s[i]+stackChar.back()=='{'+'}')
				stackChar.pop_back();
			else
				stackChar.push_back(s[i]);
		}
		if(stackChar.size()==0)
			return 1;
		else
			return 0;
    }
};