Package g2401_2500.s2497_maximum_star_sum_of_a_graph

Class Solution

java.lang.Object

g2401_2500.s2497_maximum_star_sum_of_a_graph.Solution

public class Solution
extends Object

2497 - Maximum Star Sum of a Graph.<p>Medium</p> <p>There is an undirected graph consisting of <code>n</code> nodes numbered from <code>0</code> to <code>n - 1</code>. You are given a <strong>0-indexed</strong> integer array <code>vals</code> of length <code>n</code> where <code>vals[i]</code> denotes the value of the <code>i^th</code> node.</p> <p>You are also given a 2D integer array <code>edges</code> where <code>edges[i] = [a_i, b_i]</code> denotes that there exists an <strong>undirected</strong> edge connecting nodes <code>a_i</code> and <code>b_i.</code></p> <p>A <strong>star graph</strong> is a subgraph of the given graph having a center node containing <code>0</code> or more neighbors. In other words, it is a subset of edges of the given graph such that there exists a common node for all edges.</p> <p>The image below shows star graphs with <code>3</code> and <code>4</code> neighbors respectively, centered at the blue node.</p> <p><img src="https://assets.leetcode.com/uploads/2022/11/07/max-star-sum-descdrawio.png" alt="" /></p> <p>The <strong>star sum</strong> is the sum of the values of all the nodes present in the star graph.</p> <p>Given an integer <code>k</code>, return <em>the <strong>maximum star sum</strong> of a star graph containing <strong>at most</strong></em> <code>k</code> <em>edges.</em></p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2022/11/07/max-star-sum-example1drawio.png" alt="" /></p> <p><strong>Input:</strong> vals = [1,2,3,4,10,-10,-20], edges = [[0,1],[1,2],[1,3],[3,4],[3,5],[3,6]], k = 2</p> <p><strong>Output:</strong> 16</p> <p><strong>Explanation:</strong> The above diagram represents the input graph.</p> <p>The star graph with the maximum star sum is denoted by blue.</p> <p>It is centered at 3 and includes its neighbors 1 and 4. It can be shown it is not possible to get a star graph with a sum greater than 16.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> vals = [-5], edges = [], k = 0</p> <p><strong>Output:</strong> -5</p> <p><strong>Explanation:</strong> There is only one possible star graph, which is node 0 itself. Hence, we return -5.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>n == vals.length</code></li> <li><code>1 <= n <= 10⁵</code></li> <li><code>-10⁴ <= vals[i] <= 10⁴</code></li> <li><code>0 <= edges.length <= min(n * (n - 1) / 2</code><code>, 10⁵)</code></li> <li><code>edges[i].length == 2</code></li> <li><code>0 <= a_i, b_i <= n - 1</code></li> <li><code>a_i != b_i</code></li> <li><code>0 <= k <= n - 1</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	maxStarSum(int[] nodeValues, int[][] edges, int maxNumberOfEdges)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

maxStarSum

public int maxStarSum(int[] nodeValues,
 int[][] edges,
 int maxNumberOfEdges)