373. Find K Pairs with Smallest Sums

Medium

You are given two integer arrays nums1 and nums2 sorted in ascending order and an integer k.

Define a pair (u,v) which consists of one element from the first array and one element from the second array.

Find the k pairs (u1,v1),(u2,v2) ...(uk,vk) with the smallest sums.

Example 1:

Input: nums1 = [1,7,11], nums2 = [2,4,6], k = 3
Output: [[1,2],[1,4],[1,6]] 
Explanation: The first 3 pairs are returned from the sequence: 
             [1,2],[1,4],[1,6],[7,2],[7,4],[11,2],[7,6],[11,4],[11,6]

Example 2:

Input: nums1 = [1,1,2], nums2 = [1,2,3], k = 2
Output: [1,1],[1,1]
Explanation: The first 2 pairs are returned from the sequence: 
             [1,1],[1,1],[1,2],[2,1],[1,2],[2,2],[1,3],[1,3],[2,3]

Example 3:

Input: nums1 = [1,2], nums2 = [3], k = 3
Output: [1,3],[2,3]
Explanation: All possible pairs are returned from the sequence: [1,3],[2,3]

 容易想到的解法，忽略了数组的有序性，复杂度稍高

class Solution {
    public List<int[]> kSmallestPairs(int[] nums1, int[] nums2, int k) {
        List<int[]> res = new ArrayList<>();
        if(nums1==null || nums1.length==0 || nums2==null || nums2.length==0 || k<=0)
            return res;
        PriorityQueue<int[]> heap =  new PriorityQueue<>((a,b)->(a[0]+a[1]-b[0]-b[1]));
        for(int num1:nums1){
            for(int num2:nums2){
                heap.offer(new int[]{num1,num2});
            }
        }
        int count = 0;
        while(!heap.isEmpty()&&count<k){
            count++;
            res.add(heap.poll());
        }
        return res;
    }
}

优化：考虑数组的有序性，O(klogk) 

class Solution {
    public List<int[]> kSmallestPairs(int[] nums1, int[] nums2, int k) {
        List<int[]> res = new ArrayList<>();
        if(nums1==null || nums1.length==0 || nums2==null || nums2.length==0 || k<=0)
            return res;
        PriorityQueue<int[]> heap =  new PriorityQueue<>((a,b)->(a[0]+a[1]-b[0]-b[1]));
        for(int i=0;i<nums1.length&&i<k;i++){//不超过k个
            heap.offer(new int[]{nums1[i],nums2[0],0});//数组的index=2的值代表的是index=1的索引
        }
        while(!heap.isEmpty()&&k-->0){
            int[] cur = heap.poll();
            res.add(new int[]{cur[0],cur[1]});
            if(cur[2]==nums2.length-1) continue;
            heap.offer(new int[]{cur[0],nums2[cur[2]+1],cur[2]+1});//加入一个可以对其它值构成威胁的数
        }
        return res;
    }
}