solution/2200-2299/2242.Maximum Score of a Node Sequence/Solution.py at main

main

leetcode-ion

388 issues
2 pull requests
5,000 files
1 active branch

List view

solution\2200-2299\2242.Maximum Score of a Node Sequence\Solution.py

7 Complexity
7 Complexity / M
0 Duplication
1 Churn
16 Lines
16 Lines of Code
1 Methods
16 LOC / Method

class Solution:
    def maximumScore(self, scores: List[int], edges: List[List[int]]) -> int:
        g = defaultdict(list)
        for a, b in edges:
            g[a].append(b)
            g[b].append(a)
        for k in g.keys():
            g[k] = nlargest(3, g[k], key=lambda x: scores[x])
        ans = -1
        for a, b in edges:
            for c in g[a]:
                for d in g[b]:
                    if b != c != d != a:
                        t = scores[a] + scores[b] + scores[c] + scores[d]
                        ans = max(ans, t)
        return ans