leetcode 1190. 反转每对括号间的子串

用栈解决就行， 遇到右括号，就反转再塞回去。

class Solution {
    public String reverseParentheses(String s) {
        Stack<Character> stack = new Stack<>();
        int top = 0;
        List<Character> tmp = new ArrayList<Character>();
        for(char c : s.toCharArray()) {
            if(c == ')'){
                int i = 0;
                char topC;
                while(stack.peek() != '('){
                    topC = stack.pop();
                    tmp.add(topC);
                }
                stack.pop();
                
                for(Character tmpc : tmp){
                    stack.push(tmpc);
                }
                tmp.clear();
            }
            else{
                stack.push(c);
            }
        }
        
        StringBuilder sb = new StringBuilder();
        while(!stack.isEmpty()){
            tmp.add(stack.pop());
        }
        
        for(int i = tmp.size()-1; i >=0;i--){
            sb.append(tmp.get(i));
        }
        return sb.toString();
    }
}