2018年9月27日
350. Intersection of Two Arrays II
摘要： https://leetcode.com/problems/intersection-of-two-arrays-ii/discuss/82450/Java-O(m+n)-using-Hash-and-List 阅读全文
posted @ 2018-09-27 12:17 jasoncool1 阅读(96) 评论(0) 推荐(0) 编辑
151. Reverse Words in a String
摘要： str.trim.split(" +") 然后用StringBuilderhttps://leetcode.com/problems/reverse-words-in-a-string/discuss/161008/6-line-Java-answer 阅读全文
posted @ 2018-09-27 10:37 jasoncool1 阅读(120) 评论(0) 推荐(0) 编辑
414. Third Maximum Number
摘要： 可以用priorityqueuePriorityQueue<Integer> pq = new PriorityQueue<>(); https://leetcode.com/problems/third-maximum-number/discuss/90190/Java-PriorityQueue 阅读全文
posted @ 2018-09-27 10:06 jasoncool1 阅读(108) 评论(0) 推荐(0) 编辑