2019年5月28日
一些编程要记的Utility
摘要： 用PriorityQueue实现Max Heap：new PriorityQueue<>((x,y) -> y-x); 阅读全文
posted @ 2019-05-28 12:51 英儿33 阅读(267) 评论(0) 推荐(0)
[LeetCode] Course Schedule II
摘要： There are a total of n courses you have to take, labeled from 0 to n - 1. Some courses may have prerequisites, for example to take course 0 you have t 阅读全文
posted @ 2019-05-28 09:36 英儿33 阅读(143) 评论(0) 推荐(0)