首页 > 其他 > 详细

LC 856. Score of Parentheses

时间:2018-12-28 21:46:26      阅读:170      评论:0      收藏:0      [点我收藏+]

Given a balanced parentheses string S, compute the score of the string based on the following rule:

  • () has score 1
  • AB has score A + B, where A and B are balanced parentheses strings.
  • (A) has score 2 * A, where A is a balanced parentheses string.

 

Example 1:

Input: "()"
Output: 1

Example 2:

Input: "(())"
Output: 2

Example 3:

Input: "()()"
Output: 2

Example 4:

Input: "(()(()))"
Output: 6

 

Note:

  1. S is a balanced parentheses string, containing only ( and ).
  2. 2 <= S.length <= 50

Runtime: 0 ms, faster than 100.00% of C++ online submissions for Score of Parentheses.

(A) = 2 * A 是表示深度的一个概念。

 

class Solution {
public:
  int scoreOfParentheses(string S) {
    int ret = 0, cnt = 0;
    char last =  ;
    for(auto ch : S){
      if(ch == (){
        cnt++;
      }else {
        cnt--;
        if(last == (){
          ret += (1<<cnt);
        }
      }
      last = ch;
    }
    return ret;
  }
};

 

LC 856. Score of Parentheses

原文:https://www.cnblogs.com/ethanhong/p/10192920.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!