摘要:
https://leetcode.com/problems/intersection-of-two-arrays-ii/discuss/82450/Java-O(m+n)-using-Hash-and-List 阅读全文
摘要:
str.trim.split(" +") 然后用StringBuilderhttps://leetcode.com/problems/reverse-words-in-a-string/discuss/161008/6-line-Java-answer 阅读全文
摘要:
可以用priorityqueuePriorityQueue<Integer> pq = new PriorityQueue<>(); https://leetcode.com/problems/third-maximum-number/discuss/90190/Java-PriorityQueue 阅读全文