[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 (u1,v1),(u2,v2) ...(uk,vk) 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]

思路: 一种naive的做法是产生所有组合然后排序, 取最小的k个即可, 这种时间复杂度为O(mn log(mn)). 还有一种不需要产生所有的组合, 这种思想有点像寻找第k个丑数, 记录一下nums1中每个数对应nums2中组合的位置. 然后每次找到能够产生最小的组合即可.

代码如下:

class Solution {
public:
    vector<pair<int, int>> kSmallestPairs(vector<int>& nums1, vector<int>& nums2, int k) {
        int len1 = nums1.size(), len2 = nums2.size(), cnt = min(k, len1*len2);
        vector<int> index(len1, 0);
        vector<pair<int, int>> ans;
        while(cnt-- > 0)
        {
            int temMin = INT_MAX, m = 0;
            for(int i =0; i < len1; i++)
                if(index[i] < len2 && nums1[i]+nums2[index[i]] < temMin) 
                    temMin= nums1[i]+nums2[index[i]], m = i;
            ans.push_back(make_pair(nums1[m], nums2[index[m]++]));
        }
        return ans;
    }
};

参考: https://discuss.leetcode.com/topic/50421/c-priority_queue-solution