1190. 反转每对括号间的子串
用栈操作,注意要将(入栈
class Solution {
public String reverseParentheses(String s) {
Deque<String> stack=new LinkedList<>();
for(int i=0;i<s.length();i++){
if(s.charAt(i)>=97&&s.charAt(i)<=122||s.charAt(i)=='('){
stack.offerFirst(String.valueOf(s.charAt(i)));//入栈
}else if(s.charAt(i)==')'){
StringBuffer t=new StringBuffer();
while(!"(".equals(stack.peekFirst())){
t.insert(0,stack.pollFirst());
}
stack.pollFirst();//把(弹出来
stack.offerFirst(t.reverse().toString());
}
}
StringBuffer res=new StringBuffer();
while(!stack.isEmpty()){
res.insert(0,stack.pollFirst());
}
return res.toString();
}
}