摘要:
Design a class to find the kth largest element in a stream. Note that it is the kth largest element in the sorted order, not the kth distinct element. 阅读全文
posted @ 2018-10-12 10:59
bernieloveslife
阅读(280)
评论(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 @ 2018-10-12 10:59
bernieloveslife
阅读(216)
评论(0)
推荐(0)
摘要:
In a row of seats, 1 represents a person sitting in that seat, and 0 represents that the seat is empty. There is at least one empty seat, and at least 阅读全文
posted @ 2018-10-12 10:59
bernieloveslife
阅读(198)
评论(0)
推荐(0)

浙公网安备 33010602011771号