Skip to main content

Graph Question - Hard Level - Question 1

2246. Longest Path With Different Adjacent Characters

You are given a tree (i.e. a connected, undirected graph that has no cycles) rooted at node 0 consisting of n nodes numbered from 0 to n - 1. The tree is represented by a 0-indexed array parent of size n, where parent[i] is the parent of node i. Since node 0 is the root, parent[0] == -1.

You are also given a string s of length n, where s[i] is the character assigned to node i.

Return the length of the longest path in the tree such that no pair of adjacent nodes on the path have the same character assigned to them.

Constraints:

n == parent.length == s.length
1 <= n <= 10^5
0 <= parent[i] <= n - 1 for all i >= 1
parent[0] == -1
parent represents a valid tree.
s consists of only lowercase English letters.


Analysis

For this question, we need to construct a graph, or more specifically, a n-nary tree.

How to construct the graph/tree?

What we only know is the parent array. So we need to go through the parent array and construct the graph: for each node, save their children.

After having the graph/tree, we can do a bottom-up traversal, from which we can get the longest path starting with each node (with no pair of adjacent nodes the same).

For each node in the tree, the path could be the combination of the longest path + second longest path. So we can use a bottom-up dfs search to find this.

Pay attention to the return value of the dfs function, since we can only return the longest path starting with the node, not the combined one.

See the code below:

class Solution {
public:
    int longestPath(vector<int>& parent, string s) {
        int n = s.size(), root = -1, res = 1;
        vector<vector<int>> g(n);
        for(int i=0; i<n; ++i) {
            if(parent[i] == -1) {
                root = i;
                continue;
            }
            g[parent[i]].push_back(i);
        }
        dfs(root, g, s, res);
        return res;
    }
private:
    int dfs(int r, vector<vector<int>>& g, string& s, int& res) {
        priority_queue<int, vector<int>, greater<int>> pq;
        for(auto &a : g[r]) {
            int v = dfs(a, g, s, res);
            if(s[r] != s[a]) {
                pq.push(v);
                if(pq.size()>2) pq.pop();
            }
        }
        int sd = 0, ft = 0;
        if(pq.size()) {
            sd = pq.top();
            pq.pop();
        }
        if(pq.size()) {
            ft = pq.top();
            pq.pop();
        }
        res = max(res, 1 + sd + ft);
        return 1 + max(sd, ft);
    }
};




Comments

Popular posts from this blog

Brute Force - Question 2

2105. Watering Plants II Alice and Bob want to water n plants in their garden. The plants are arranged in a row and are labeled from 0 to n - 1 from left to right where the ith plant is located at x = i. Each plant needs a specific amount of water. Alice and Bob have a watering can each, initially full. They water the plants in the following way: Alice waters the plants in order from left to right, starting from the 0th plant. Bob waters the plants in order from right to left, starting from the (n - 1)th plant. They begin watering the plants simultaneously. It takes the same amount of time to water each plant regardless of how much water it needs. Alice/Bob must water the plant if they have enough in their can to fully water it. Otherwise, they first refill their can (instantaneously) then water the plant. In case both Alice and Bob reach the same plant, the one with more water currently in his/her watering can should water this plant. If they have the same amount of water, then Alice ...

Sweep Line

Sweep (or scanning) line algorithm is very efficient for some specific questions involving discrete intervals. The intervals could be the lasting time of events, or the width of a building or an abstract square, etc. In the scanning line algorithm, we usually need to distinguish the start and the end of an interval. After the labeling of the starts and ends, we can sort them together based on the values of the starts and ends. Thus, if there are N intervals in total, we will have 2*N data points (since each interval will contribute 2). The sorting becomes the most time-consuming step, which is O(2N*log(2N) ~ O(N*logN). After the sorting, we usually can run a linear sweep for all the data points. If the data point is labeled as a starting point, it means a new interval is in the processing; when an ending time is reached, it means one of the interval has ended. In such direct way, we can easily figure out how many intervals are in the processes. Other related information can also be obt...

Dynamic Programming - Easy Level - Question 1

Dynamic Programming - Easy Level - Question 1 Leetcode 1646  Get Maximum in Generated Array You are given an integer n. An array nums of length n + 1 is generated in the following way: nums[0] = 0 nums[1] = 1 nums[2 * i] = nums[i] when 2 <= 2 * i <= n nums[2 * i + 1] = nums[i] + nums[i + 1] when 2 <= 2 * i + 1 <= n Return the maximum integer in the array nums​​​. Constraints: 0 <= n <= 100 Analysis: This question is quick straightforward: the state and transitional formula are given; the initialization is also given. So we can just ready the code to iterate all the states and find the maximum. See the code below: class Solution { public: int getMaximumGenerated(int n) { int res = 0; if(n<2) return n; vector<int> f(n+1, 0); f[1] = 1; for(int i=2; i<=n; ++i) { if(i&1) f[i] = f[i/2] + f[i/2+1]; else f[i] = f[i/2]; // cout<<i<<" "<<f[i]<<endl; ...