LeetCode Online Judge 题目C# 练习 - Valid Parentheses-优快云博客

本文介绍了一个使用栈数据结构实现的有效括号匹配验证算法。通过遍历输入字符串中的括号，该算法能正确判断括号是否成对出现并按正确顺序闭合。对于左括号，将其压入栈中；对于右括号，则从栈中弹出相应的左括号进行匹配，最终确保栈为空则表示括号匹配正确。

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.

 1         public static bool ValidParentheses(string s)
 2         {
 3             Stack<char> stack = new Stack<char>();
 4 
 5             for (int i = 0; i < s.Length; i++)
 6             {
 7                 if (s[i] == '(' || s[i] == '[' || s[i] == '{')
 8                     stack.Push(s[i]);
 9                 else
10                 {
11                     // begin with ')', ']' or '}'?
12                     if (stack.Count == 0)
13                         return false;
14                     
15                     if (s[i] == ')')
16                     {
17                         if (stack.Peek() == '(')
18                         {
19                             stack.Pop();
20                         }
21                         else
22                             return false;
23                     }
24                     else if (s[i] == ']')
25                     {
26                         if (stack.Peek() == '[')
27                         {
28                             stack.Pop();
29                         }
30                         else
31                             return false;
32                     }
33                     else if (s[i] == '}')
34                     {
35                         if (stack.Peek() == '{')
36                         {
37                             stack.Pop();
38                         }
39                         else
40                             return false;
41                     }
42                 }
43             }
44 
45             return stack.Count == 0;
46         }