EvanMeetTheWorld

摘要：如果我们要利用Index 比如说我们想把uf[]数组变成下面这样： {0, 0, 2, 3, 2, 0} 这个意味着node0, n... 阅读全文

posted @ 2020-12-03 02:40 EvanMeetTheWorld 阅读(20) 评论(0) 推荐(0)

摘要：首先来看名字：优先队列：说到底还是一种队列不过是一种特殊的队列他的工作就是poll()/peek()出队列中最大/最小的那个... 阅读全文

posted @ 2020-12-03 01:59 EvanMeetTheWorld 阅读(95) 评论(0) 推荐(0)

摘要：不要再憨憨的只想到：自己手动写排序/用Arrays.sort()/或者给Arrays.sort加个自定义的比较器啥的。虽然说这三种... 阅读全文

posted @ 2020-12-03 00:21 EvanMeetTheWorld 阅读(19) 评论(0) 推荐(0)

摘要： You are given a string s, and an array of pairs of indices in the ... 阅读全文

posted @ 2020-12-02 13:07 EvanMeetTheWorld 阅读(22) 评论(0) 推荐(0)

摘要： There are n cities numbered from 0 to n-1 and n-1 roads such that ... 阅读全文

posted @ 2020-12-01 13:01 EvanMeetTheWorld 阅读(24) 评论(0) 推荐(0)

摘要： map.computeIfAbsent(K key, Function lambda) is used to compute val... 阅读全文

posted @ 2020-12-01 11:04 EvanMeetTheWorld 阅读(185) 评论(0) 推荐(0)

摘要： There are a total of n courses you have to take, labeled from 0 to... 阅读全文

posted @ 2020-12-01 09:49 EvanMeetTheWorld 阅读(25) 评论(0) 推荐(0)

摘要： Given a set of N people (numbered 1, 2, …, N), we would like to sp... 阅读全文

posted @ 2020-11-30 12:56 EvanMeetTheWorld 阅读(20) 评论(0) 推荐(0)

摘要： You are given a map of a server center, represented as a m * n int... 阅读全文

posted @ 2020-11-30 11:10 EvanMeetTheWorld 阅读(30) 评论(0) 推荐(0)

摘要： There are n cities numbered from 0 to n-1. Given the array edges w... 阅读全文

posted @ 2020-11-30 05:51 EvanMeetTheWorld 阅读(50) 评论(0) 推荐(0)