LeetCode每日打卡 - 反转每对括号间的子串

古城微笑少年丶 2022-10-16 05:55 105阅读 0赞

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MzczNjA4NA_size_16_color_FFFFFF_t_70]  
题解中有个更好的思路，stack存入的不是(的坐标，存入每次到左括号的字符串，拿到右括号就对其进行反转，更妙一些。

import java.util.Stack;
    class Solution { 
        public String reverseParentheses(String s) { 
            Stack<Integer> stack = new Stack<>();
            char [] cs = s.toCharArray();
            StringBuilder sb = new StringBuilder();
            for(int i = 0; i < cs.length; i++){ 
                if(cs[i] == '('){ 
                    stack.push(i);
                }
                if(cs[i] == ')'){ 
                    //反转
                    reverse(stack.pop(),i,cs);
                }
            }
    
            for(char c : cs){ 
                if(c == '(' || c == ')'){ 
                    continue;
                }
                sb.append(c+"");
            }
    
            return sb.toString();
        }
    
        public void reverse(int left, int right, char [] cs){ 
            while(left <= right){ 
                char temp = cs[left];
                cs[left] = cs[right];
                cs[right] = temp;
                left++;
                right--;
            }
        }
    }

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MzczNjA4NA_size_16_color_FFFFFF_t_70]: /images/20221014/52d3c04c6e174e3abe802ad73e29a417.png