java栈队列优先队列算法

java栈队列优先队列算法

栈

public class Solution {
	//将做方向的括号放入栈中
    Stack<Character> stack = new Stack<Character>();
    for( int i = 0 ; i < s.length() ; i ++ )
        if( s.charAt(i) == '(' || s.charAt(i) == '{' || s.charAt(i) == '[')
            stack.push(s.charAt(i));	
	//遇到右方向的括号，取出栈中的元素，判断是否匹配
        else{

            if( stack.size() == 0 )
                return false;

            Character c = stack.pop();

            Character match;
            if( s.charAt(i) == ')' )
                match = '(';
            else if( s.charAt(i) == ']'