leetcode-373. Find K Pairs with Smallest Sums

最新推荐文章于 2026-05-02 20:00:00 发布

原创最新推荐文章于 2026-05-02 20:00:00 发布 · 364 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

Leetcode

本文介绍了一个算法问题：从两个已排序整数数组中找到和最小的k对元素组合。通过双层循环配合multimap实现自动排序，从而选取前k个最小和的元素对。

一、题目描述

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]

二、代码

class Solution {
public:
    vector<pair<int, int>> kSmallestPairs(vector<int>& nums1, vector<int>& nums2, int k) {
        multimap<int, pair<int, int> > m;
        vector<pair<int, int> > res;
        pair<int, int> p;
        for (int i = 0; i < min(k, (int)nums1.size()); i++) {
        	for (int j = 0; j < min(k, (int)nums2.size()); j++) {
        		p.first = nums1[i];
        		p.second = nums2[j];
        		m.insert({nums1[i]+nums2[j], p});
        	}
        }
        map<int, pair<int, int> >::iterator it;
        for (it = m.begin(); it != m.end(); it++) {
        	res.push_back(it->second);
        	k--;
        	if (k == 0) {
        		return res;
        	}
        }
        return res;
    }
};

三、分析

此程序有点暴力输出，有一个双重for循环，再通过multimap自带的内部排序，选取和最小的的前k个。