• Home
• com.github.javadev
• leetcode-in-java
• 1.23
• source code
• Solution.java

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g2601_2700.s2603_collect_coins_in_a_tree.Solution Maven / Gradle / Ivy

package g2601_2700.s2603_collect_coins_in_a_tree;

// #Hard #Array #Tree #Graph #Topological_Sort
// #2023_08_29_Time_26_ms_(100.00%)_Space_66.3_MB_(32.97%)

import java.util.ArrayList;
import java.util.List;

public class Solution {
    private int[] coins;
    private List[] graph;
    private int sum;
    private int ret;

    public int collectTheCoins(int[] coins, int[][] edges) {
        int n = coins.length;
        this.coins = coins;
        graph = new ArrayList[n];
        for (int i = 0; i < n; i++) {
            graph[i] = new ArrayList<>();
        }
        for (int[] edge : edges) {
            graph[edge[0]].add(edge[1]);
            graph[edge[1]].add(edge[0]);
        }
        for (int coin : coins) {
            sum += coin;
        }
        dfs(0, -1);
        return Math.max(2 * (ret - 1), 0);
    }

    private int dfs(int node, int pre) {
        int cnt = 0;
        int s = 0;
        for (int nn : graph[node]) {
            if (nn != pre) {
                int r = dfs(nn, node);
                if (r - coins[nn] > 0) {
                    cnt++;
                }
                s += r;
            }
        }
        if (pre != -1 && sum - s - coins[node] - coins[pre] > 0) {
            cnt++;
        }
        if (cnt >= 2) {
            ret++;
        }
        return s + coins[node];
    }
}