1021. Remove Outermost Parentheses

A valid parentheses string is either empty ("")"(" + A + ")", or A + B, where A and B are valid parentheses strings, and + represents string concatenation.  For example, """()""(())()", and "(()(()))" are all valid parentheses strings.

A valid parentheses string S is primitive if it is nonempty, and there does not exist a way to split it into S = A+B, with A and B nonempty valid parentheses strings.

Given a valid parentheses string S, consider its primitive decomposition: S = P_1 + P_2 + ... + P_k, where P_iare primitive valid parentheses strings.

Return S after removing the outermost parentheses of every primitive string in the primitive decomposition of S.

 

Example 1:

Input: "(()())(())"
Output: "()()()"
Explanation: 
The input string is "(()())(())", with primitive decomposition "(()())" + "(())".
After removing outer parentheses of each part, this is "()()" + "()" = "()()()".

Example 2:

Input: "(()())(())(()(()))"
Output: "()()()()(())"
Explanation: 
The input string is "(()())(())(()(()))", with primitive decomposition "(()())" + "(())" + "(()(()))".
After removing outer parentheses of each part, this is "()()" + "()" + "()(())" = "()()()()(())".

Example 3:

Input: "()()"
Output: ""
Explanation: 
The input string is "()()", with primitive decomposition "()" + "()".
After removing outer parentheses of each part, this is "" + "" = "".

 

Note:

  1. S.length <= 10000
  2. S[i] is "(" or ")"
  3. S is a valid parentheses string

题意:给出一个只包含"("和")"的字符串,其由若干个合法的小括号字符串组成。要求将每部分合法小字符串去掉最外层的括号再输出。

思路:设置一个计数器变量flag,当遇到"("时计数器加1,当遇到")"时计数器减1。当计数器的值为0时不输出字符,其余时刻输出字符即可。

class Solution {
public:
    string removeOuterParentheses(string S) {
        int flag=0;
        string s;
        for(int i=0;i<S.length();i++){
            if(flag==0){
                flag++;
                continue;
            }
            if(S[i]=='('){
                flag++;
                s+=S[i];
            }else{
                flag--;
                if(flag==0){
                    continue;
                }else{
                    s+=S[i];
                }
            }
        }
        return  s;    
    }
}; 

规范化代码:

class Solution {
public:
    string removeOuterParentheses(string S) {
        int flag=0;
        string s;
        for(int i=0;i<S.length();i++){
            if(S[i]=='('&&flag++>0)
                s+=S[i];
            if(S[i]==')'&&flag-->1)
                s+=S[i];
        }
        return  s;    
    }
}; 

 

  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值