373. 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 (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]

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/find-k-pairs-with-smallest-sums
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

 

给定两个以升序排列的整形数组 nums1 和 nums2, 以及一个整数 k。

定义一对值 (u,v)，其中第一个元素来自 nums1，第二个元素来自 nums2。

找到和最小的 k 对数字 (u1,v1), (u2,v2) ... (uk,vk)。

用一个index[i]数组放置，nums1[i]对的遍历nums2[index[i]]中的遍历进度，如果nums1[i], nums2[i]已经加如队列中，那么nums1[i], nums2[i - 1]一定也加入了。

class Solution {
    public List<List<Integer>> kSmallestPairs(int[] nums1, int[] nums2, int k) {
        List<List<Integer>> list = new ArrayList<List<Integer>>();
        int []index = new int[nums1.length];
        int size = Math.min(k, nums1.length * nums2.length);
        for (int i = 0; i < size; i++) {
            int curMin = Integer.MAX_VALUE;
            int curIndex = 0;
            for (int j = 0; j < nums1.length; j++) {
                if (index[j] < nums2.length && nums1[j] + nums2[index[j]]< curMin) {
                    curMin = nums1[j] + nums2[index[j]];
                    curIndex = j;
                }
            }
            List<Integer>tmp = new ArrayList<Integer>();
            tmp.add(nums1[curIndex]);
            tmp.add(nums2[index[curIndex]]);
            list.add(tmp);
            index[curIndex]++;
        }
        return list;
    }
}