Leetcode 856. Score of Parentheses

最新推荐文章于 2024-01-17 04:58:56 发布

Simple_ R

最新推荐文章于 2024-01-17 04:58:56 发布

阅读量355

点赞数

分类专栏： LeedCode365 算法和数据结构文章标签：递归算法 leetcode

本文链接：https://blog.csdn.net/M_sdn/article/details/86667712

版权

LeedCode365 同时被 2 个专栏收录

68 篇文章 0 订阅

订阅专栏

算法和数据结构

44 篇文章 0 订阅

订阅专栏

递归专题1

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:

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

public static int scoreOfParentheses(String S) {
        return score(S);
    }

    private static int score(String sub) {
        if (sub.equals("()")) { //case ()
            return 1;
        }
        int balanceBias = 0;
        for (int i = 0; i < sub.length(); i++) {
            if (sub.charAt(i) == '(') balanceBias++;
            if (sub.charAt(i) == ')') balanceBias--;
            //case (A)+(B)，但是(A)这个形式的组合也走这里，所以加一个判断
            if (balanceBias == 0 && !sub.equals(sub.substring(0,i+1)))
                return score(sub.substring(0,i+1)) + score(sub.substring(i+1,sub.length()));
        }
        //case (A)
        return 2*score(sub.substring(1, sub.length()-1));
    }