和最小的K对数字 Find K Pairs with Smallest Sums

最新推荐文章于 2020-12-04 09:42:10 发布

weixin_33860737

最新推荐文章于 2020-12-04 09:42:10 发布

阅读量71

点赞数

文章标签： python

原文链接：https://my.oschina.net/liyurong/blog/1595853

版权

2019独角兽企业重金招聘Python工程师标准>>>

问题：

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]

解决：

① 给定两个数组，从每个数组中任意取出一个数字来组成不同的数字对，返回前K个和最小的数字对。这个题类似于超级丑陋数，基本思想是使用数组来跟踪另一个数组中的下一个元素的索引。

class Solution { //9ms
public List<int[]> kSmallestPairs(int[] nums1, int[] nums2, int k) {
List<int[]> res = new ArrayList<>();
k = Math.min(k,nums1.length * nums2.length);
if (k == 0) return res;
int[] index = new int[nums1.length];
while(k > 0){
int minSum = Integer.MAX_VALUE;
int tmp = 0;//记录数组1中的下标
for (int i = 0;i < nums1.length;i ++){
if (index[i] < nums2.length && nums1[i] + nums2[index[i]] < minSum){
tmp = i;
minSum = nums1[i] + nums2[index[i]];
}
}
int[] arr = {nums1[tmp],nums2[index[tmp]]};
res.add(arr);
index[tmp] ++;
k --;
}
return res;
}
}