摘要：
class Solution { public void merge(int[] nums1, int m, int[] nums2, int n) { int[] res = new int[m+n+1]; int l1 = 0; int l2 = 0; int i=0; while((l1<m) 阅读全文
摘要：
class Solution { public int longestConsecutive(int[] nums) { if(nums==null){ return 0; } Arrays.sort(nums); PriorityQueue<Integer> que = new PriorityQ 阅读全文
摘要：
class Solution { public int longestConsecutive(int[] nums) { if(nums==null){ return 0; } Arrays.sort(nums); PriorityQueue<Integer> que = new PriorityQ 阅读全文