LeetCode #20 Valid Parentheses C C++ Java解法

C解法：

bool isMatch(char a,char b)
{
if((a == '(' && b == ')') || (a == '[' && b == ']') || (a == '{' && b == '}'))
return true;
return false;
} 
bool isValid(char *s) {
    char *ans = (char*)malloc(strlen(s));
    int pos = 0;
    for(int i = 0; i < strlen(s); ++i)
    {
    if(s[i] == '(' || s[i] == '[' || s[i] == '{')//左括号进栈 
ans[pos++] = s[i];  
else if(s[i] == ')' || s[i] == ']' || s[i] == '}')//右括号出栈
{
if(pos == 0 || !isMatch(ans[pos - 1],s[i]))
return false;
pos--;
}
else
continue;  
    }
    return pos == 0 ? true : false;
}

C++解法：
using namespace std;
class Solution {
public:
bool isMatched(char a,char b)
{
if((a == '(' && b == ')') || (a == '[' && b == ']') || (a == '{' && b == '}'))
return true;
return false;
}
    bool isValid(string s) {
    stack<char> s1;//定义栈 
    for(int i = 0; i < s.size(); ++i)
{
if(s[i] == '(' || s[i] == '[' || s[i] == '{' )//左括号进栈 
s1.push(s[i]);
else if(s[i] == ')' || s[i] == ']' || s[i] == '}' )//右括号出栈 
{
if(s1.empty() || !isMatched(s1.top(),s[i]))
return false;
s1.pop();
}  
else //其他符号直接跳过 
continue;
}
return s1.empty() ? true : false;
    }
};

JAVA解法：

public class Solution {
public boolean isMatch(char a,char b)
{
if((a == '(' && b == ')') || (a == '[' && b == ']') || (a == '{' && b == '}'))
return true;
return false;
}
    public boolean isValid(String s) {
    LinkedList<Character> l = new LinkedList<Character>();
for(int i = 0; i < s.length(); ++i)
{
if(s.charAt(i) == '(' || s.charAt(i) == '[' || s.charAt(i) == '{')
l.add(s.charAt(i));
else if(s.charAt(i) == ')' || s.charAt(i) == ']' || s.charAt(i) == '}')
{
if(l.isEmpty() || !isMatch(l.getLast(),s.charAt(i)))
return false;
l.removeLast();
}
else
continue;
}

    return l.isEmpty();
        
    }
}