Skip to main content

Graph - Medium Level - Question 1

Graph - Medium Level - Question 1


Leetcode 2049. Count Nodes With the Highest Score

There is a binary tree rooted at 0 consisting of n nodes. The nodes are labeled from 0 to n - 1. You are given a 0-indexed integer array parents representing the tree, where parents[i] is the parent of node i. Since node 0 is the root, parents[0] == -1.

Each node has a score. To find the score of a node, consider if the node and the edges connected to it were removed. The tree would become one or more non-empty subtrees. The size of a subtree is the number of the nodes in it. The score of the node is the product of the sizes of all those subtrees.

Return the number of nodes that have the highest score.


Constraints:


n == parents.length

2 <= n <= 10^5

parents[0] == -1

0 <= parents[i] <= n - 1 for i != 0

parents represents a valid binary tree.


Analysis:

If we have had the binary tree, then we just can do a top-down count, to count the number of nodes for the sub-tree with the root as the current nodes. But we do not have the tree, instead, we only know the parents of each nodes.

So we need to construct the binary tree by ourselves. This process can be generalized to build a graph.

Since we need to know the number of nodes of the subtree with the root as the current node, so we need to know the children nodes of each nodes. And also we need to know the root.

For this question, we can use a two dimensional array to simply the graph notation. The array index would be the node index, and the array contents are for the children nodes.

After having the graph, we can do a top-down traversal to count the number of nodes "below" the node, starting with the root node. A dynamical programming trick is needed here as well, to record the numbers.

After having all the information we need, we can check each node, to see which one give the highest score, and count its times. If the node is the root, we just need to check its children nodes.


See the code below:


class Solution {
public:
    int countHighestScoreNodes(vector<int>& parents) {
        int n = parents.size(), root = 0;
        long res = -1, num = 0;
        vector<long> dp(n, 0);
        vector<vector<long>> g(n);
        for(int i=0; i<n; ++i) {
            if(parents[i] == -1) root = i;
            else g[parents[i]].push_back(i);
        }
        ct(root, g, dp);
        for(int i=0; i<n; ++i) {
            // cout<<i<<" "<<dp[i]<<endl;
        }
        for(int i=0; i<n; ++i) {
            long one = 0;
            if(i == root) {
                if(g[i].size() == 2) one = dp[g[i][0]]*dp[g[i][1]];
                else if(g[i].size() == 1) one = dp[g[i][0]];
            }
            else {
                if(g[i].size() == 0) one = dp[root] - 1;
                else if(g[i].size() == 1) one = dp[g[i][0]] *(dp[root] - dp[i]);
                else if(g[i].size() == 2) one = dp[g[i][0]] * dp[g[i][1]] * (dp[root] - dp[i]);
            }
            if(res < one) {
                res = one;
                num = 1;
            }
            else if(res == one) ++num;
        }
        return num;
    }
private:
    long ct(int root, vector<vector<long>>& g, vector<long>& dp) {
        for(auto &a : g[root]) {
            dp[root] += ct(a, g, dp);
        }
        return dp[root] += 1;
    }
};


Made some change to let the code can be used for a n-ary tree:


class Solution {
public:
    int countHighestScoreNodes(vector<int>& parents) {
        int n = parents.size(), root = 0;
        long res = -1, num = 0;
        vector<long> dp(n, 0);
        vector<vector<long>> g(n);
        for(int i=0; i<n; ++i) {
            if(parents[i] == -1) root = i;
            else g[parents[i]].push_back(i);
        }
        ct(root, g, dp);
        for(int i=0; i<n; ++i) {
            long one = i == root ? 1 : dp[root] - dp[i];
            for(auto &a : g[i]) {
                one *= dp[a];
            }
            if(res < one) {
                res = one;
                num = 1;
            }
            else if(res == one) ++num;
        }
        return num;
    }
private:
    long ct(int root, vector<vector<long>>& g, vector<long>& dp) {
        for(auto &a : g[root]) {
            dp[root] += ct(a, g, dp);
        }
        return dp[root] += 1;
    }
};


Upper Layer

Comments

Post a Comment

Popular posts from this blog

Binary Search - Hard Level - Question 3

Binary Search - Hard Level - Question 3 878. Nth Magical Number A positive integer is magical if it is divisible by either a or b. Given the three integers n, a, and b, return the nth magical number. Since the answer may be very large, return it modulo 10^9 + 7. Analysis: Let us consider some examples first. Example 1, a = 4, b = 2. If b is dividable by a, then all the numbers which is dividable by a should be dividable by b as well. So the nth magical number should be n*b; Example 2, a = 3, b = 2. The multiples of 2 are: 2, 4, 6, 8, 10, 12, ... The multiple of 3 are: 3, 6, 9, 12, ... So the overlap is related to the minimum common multiple between a and b, and we need to remove the overlap which is double-counted. So now, we make some conclusions: 1. the upper bound of the nth magical number should be n*b, where a is the smaller one (or b <= a); 2. there are n*b/a magical numbers smaller than n*b; 3. there are n*b/(minimum common multiple) overlaps. Thus, the overall count is: n + ...
Post a Comment
Read more

Segment Tree

Segment tree can be viewed as an abstract data structure which using some more space to trade for speed. For example, for a typical question with O(N^2) time complexity, the segment tree method can decrease it to O(N*log(N)).  To make it understandable, let us consider one example. Say we have an integer array of N size, and what we want is to query the maximum with a query range [idx1, idx2], where idx1 is the left indexes, and idx2 is the right indexes inclusive. If we only do this kind of query once, then we just need to scan through the array from idx1 to idx2 once, and record the maximum, done. The time complexity is O(N), which is decent enough in most cases even though it is not the optimal one (for example, with a segment tree built, the time complexity can decrease down to O(log(N))). However, how about we need to query the array N times? If we continue to use the naïve way above, then the time complexity is O(N^2), since for each query we need to scan the query range once...
Post a Comment
Read more

Recursion - Example

Recursion - Example Leetcode 231  Power of Two Given an integer n, return true if it is a power of two. Otherwise, return false. An integer n is a power of two, if there exists an integer x such that n == 2^x Constraints: -2^31 <= n <= 2^31 - 1 Analysis: One way is to think about this question recursively: if n%2 == 1, then n must not be power of 2; if not, then we just need to consider whether (n/2) is a power of 2 or not. This is exactly the "same question with a smaller size"! It is trivial to figure out the base cases: if n == 0, return false; if n == 1, return true. See the code below: class Solution { public: bool isPowerOfTwo(int n) { // base cases if(n == 0) return false; if(n == 1) return true; // converging if(n%2 == 1) return false; return isPowerOfTwo(n/2); } }; If interested, there are some other ways to solve this problem. For example, using bit manipulation, we can have the following solution: class ...
Post a Comment
Read more