摘要：
We have a collection of rocks, each rock has a positive integer weight. Each turn, we choose the two heaviest rocks and smash them together. Suppose t 阅读全文
posted @ 2020-01-31 12:43
Schwifty
阅读(140)
评论(0)
推荐(0)
摘要：
There are n cities numbered from 0 to n-1. Given the array edges where edges[i] = [fromi, toi, weighti] represents a bidirectional and weighted edge b 阅读全文
posted @ 2020-01-31 12:02
Schwifty
阅读(267)
评论(0)
推荐(0)
摘要：
There are N network nodes, labelled 1 to N. Given times, a list of travel times as directed edges times[i] = (u, v, w), where u is the source node, v 阅读全文
posted @ 2020-01-31 10:05
Schwifty
阅读(135)
评论(0)
推荐(0)
浙公网安备 33010602011771号