LeetCode-20.Valid Parentheses

Problem:

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.

Solution:

1、（字符串拟栈）

public class Solution {
    public bool IsValid(string s)
    {
       string stack="";
       if(s.Length%2!=0)
          return false;
       
       for(int i=0;i<s.Length;i++)
       {
           if(s[i]=='('||s[i]=='{'||s[i]=='[')
                stack+=s[i];
           else
           {
                if (i == 0)
                    return false;
                if(s[i]==')')
                    if(stack[stack.Length-1]=='(')
                        stack=stack.Remove(stack.Length-1);
                    else
                        return false;
                 else if(s[i]=='}')
                    if(stack[stack.Length-1]=='{')
                        stack=stack.Remove(stack.Length-1);
                    else
                        return false;
                 else
                    if(stack[stack.Length-1]=='[')
                        stack=stack.Remove(stack.Length-1);
                    else
                        return false;
           }   
       }
       return stack=="";
    }
}

2、栈实现

public class Solution {
    public bool IsValid(string s)
    {
       if(s.Length%2!=0)
          return false;
       
       Stack<char> stack = new Stack<char>();
            for (int i = 0; i < s.Length; i++)
            {
                if (s[i] == '(' || s[i] == '{' || s[i] == '[')
                    stack.Push(s[i]);
                else
                {
                    if (stack.Count == 0)
                       return false;
                     if (s[i] == ')')
                    {
                        if (stack.Pop() != '(')
                            return false;
                    }
                    else if (s[i] == '}')
                    {
                        if (stack.Pop() != '{')
                            return false;
                    }
                    else
                    {
                        if (stack.Pop() != '[')
                            return false;
                    }
                }
            }
            return stack.Count == 0;
    }
}