05 2019 档案

摘要:Given a list of Connections, which is the Connection class (the city name at both ends of the edge and a cost between them), find edges that can conne 阅读全文
posted @ 2019-05-29 14:02 英儿33 阅读(225) 评论(0) 推荐(0)
摘要:A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null. Return a deep copy 阅读全文
posted @ 2019-05-29 06:32 英儿33 阅读(194) 评论(0) 推荐(0)
摘要:用PriorityQueue实现Max Heap:new PriorityQueue<>((x,y) -> y-x); 阅读全文
posted @ 2019-05-28 12:51 英儿33 阅读(267) 评论(0) 推荐(0)
摘要: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 阅读(145) 评论(0) 推荐(0)
摘要:Given two rectangles, find if the given two rectangles overlap or not. Given two rectangles, find if the given two rectangles overlap or not. Given tw 阅读全文
posted @ 2019-05-27 09:18 英儿33 阅读(147) 评论(0) 推荐(0)