LeetCode 373. Find K Pairs with Smallest Sums

原题网址：https://leetcode.com/problems/find-k-pairs-with-smallest-sums/

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 (u₁,v₁),(u₂,v₂) ...(u_k,v_k) with the smallest sums.

Example 1:

Given nums1 = [1,7,11], nums2 = [2,4,6],  k = 3

Return: [1,2],[1,4],[1,6]

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:

Given nums1 = [1,1,2], nums2 = [1,2,3],  k = 2

Return: [1,1],[1,1]

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:

Given nums1 = [1,2], nums2 = [3],  k = 3 

Return: [1,3],[2,3]

All possible pairs are returned from the sequence:
[1,3],[2,3]

方法一：使用堆来排序，使用布尔矩阵来记录是否使用过。

public class Solution {
    public List<int[]> kSmallestPairs(int[] nums1, int[] nums2, int k) {
        List<int[]> results = new ArrayList<>();
        if (nums1 == null || nums1.length == 0 || nums2 == null || nums2.length == 0 || k <= 0) return results;
        boolean[][] used = new boolean[nums1.length][nums2.length];
        PriorityQueue<int[]> heap = new PriorityQueue<>(new Comparator<int[]> () {
            @Override
            public int compare(int[] p1, int[] p2) {
                return (nums1[p1[0]] + nums2[p1[1]]) - (nums1[p2[0]] + nums2[p2[1]]);
            }
        });
        heap.offer(new int[] {0, 0});
        used[0][0] = true;
        while (results.size() < k && !heap.isEmpty()) {
            int[] p = heap.poll();
            results.add(new int[] {nums1[p[0]], nums2[p[1]]});
            if (p[0] + 1 < nums1.length && !used[p[0] + 1][p[1]]) {
                heap.offer(new int[] {p[0] + 1, p[1]});
                used[p[0] + 1][p[1]] = true;
            }
            if (p[1] + 1 < nums2.length && !used[p[0]][p[1] + 1]) {
                heap.offer(new int[] {p[0], p[1] + 1});
                used[p[0]][p[1] + 1] = true;
            }
        }
        return results;
    }
}

方法二：优化布尔矩阵。

public class Solution {
    public List<int[]> kSmallestPairs(int[] nums1, int[] nums2, int k) {
        List<int[]> results = new ArrayList<>();
        if (nums1 == null || nums1.length == 0 || nums2 == null || nums2.length == 0 || k <= 0) return results;
        PriorityQueue<int[]> heap = new PriorityQueue<>(new Comparator<int[]> () {
            @Override
            public int compare(int[] p1, int[] p2) {
                return (nums1[p1[0]] + nums2[p1[1]]) - (nums1[p2[0]] + nums2[p2[1]]);
            }
        });
        int[] max12 = new int[nums1.length];
        int[] max21 = new int[nums2.length];
        heap.offer(new int[] {0, 0});
        max12[0]++;
        max21[0]++;
        while (results.size() < k && !heap.isEmpty()) {
            int[] p = heap.poll();
            results.add(new int[] {nums1[p[0]], nums2[p[1]]});
            if (p[0] + 1 < nums1.length && (p[0] + 1 == max21[p[1]] && p[1] == max12[p[0] + 1])) {
                heap.offer(new int[] {p[0] + 1, p[1]});
                max12[p[0] + 1] = p[1] + 1;
                max21[p[1]] = p[0] + 1 + 1;
            }
            if (p[1] + 1 < nums2.length && (p[1] + 1 == max12[p[0]] && p[0] == max21[p[1] + 1])) {
                heap.offer(new int[] {p[0], p[1] + 1});
                max12[p[0]] = p[1] + 1 + 1;
                max21[p[1] + 1] = p[0] + 1;
            }
        }
        return results;
    }
}

简化：

public class Solution {
    public List<int[]> kSmallestPairs(int[] nums1, int[] nums2, int k) {
        List<int[]> results = new ArrayList<>();
        if (nums1 == null || nums1.length == 0 || nums2 == null || nums2.length == 0 || k <= 0) return results;
        PriorityQueue<int[]> heap = new PriorityQueue<>(new Comparator<int[]> () {
            @Override
            public int compare(int[] p1, int[] p2) {
                return (nums1[p1[0]] + nums2[p1[1]]) - (nums1[p2[0]] + nums2[p2[1]]);
            }
        });
        int[] max12 = new int[nums1.length];
        int[] max21 = new int[nums2.length];
        heap.offer(new int[] {0, 0});
        max12[0]++;
        max21[0]++;
        while (results.size() < k && !heap.isEmpty()) {
            int[] p = heap.poll();
            results.add(new int[] {nums1[p[0]], nums2[p[1]]});
            if (p[0] + 1 < nums1.length && (p[0] + 1 == max21[p[1]] && p[1] == max12[p[0] + 1])) {
                heap.offer(new int[] {p[0] + 1, p[1]});
                max12[p[0] + 1]++;
                max21[p[1]]++;
            }
            if (p[1] + 1 < nums2.length && (p[1] + 1 == max12[p[0]] && p[0] == max21[p[1] + 1])) {
                heap.offer(new int[] {p[0], p[1] + 1});
                max12[p[0]]++;
                max21[p[1] + 1]++;
            }
        }
        return results;
    }
}