花花酱 LeetCode 2242 Maximum Score of a Node Sequence - 刷题找工作 EP396

[@christopherwashington9448]

这题的确有难度。感谢花帅的讲解。

[@spiceEx]

哪天不想刷题了就随机打开huahua视频进入一下状态，对着显示器自言自语“huahua你好我是大家”。

[@jasonswift7468]

花花 今年能不能也多讲讲系统设计与AI的知识

[@timliu3987]

為什麼 nei[e[0]].size() > 3 要移除第一個而不是最小的🤔

[@yizhouxie7694]

厉害👍

[@hikari7314]

花花有没有兴趣讲解一下2281题

[@charlesqwu]

What is the EP number? -- for instance, what does the problem's EP396 mean?

[@HuaHuaLeetCode]

episode，the 396th

[@spiceEx]

前排！

[@rohit2571]

Please speak in English.

[@Dragon-ok6ne]

still got TLE in Java public int maximumScore(int[] scores, int[][] edges) { if (scores == null || edges == null) { return -1; } int n = scores.length; PriorityQueue[] map = new PriorityQueue[n]; for (int i = 0; i < n; i++) { map[i] = new PriorityQueue(); } for (int[] e : edges) { int a = e[0]; int b = e[1]; map[a].add(b); map[b].add(a); if (map[a].size() > n) { map[a].poll(); } if (map[b].size() > n) { map[b].poll(); } } int res = -1; for (int[] e : edges) { int a = e[0]; int b = e[1]; for (int c : map[a]) { for (int d : map[b]) { if (c != d && c != b && d != a) { res = Math.max(res, scores[a] + scores[b] + scores[c] + scores[d]); } } } } return res; }

[@HuaHuaLeetCode]

From: map[a].size() > n to: map[a].size() > 3