[leetCode刷题笔记]373. Find K Pairs with Smallest Sums

public class Solution {    public List<int[]> kSmallestPairs(int[] nums1, int[] nums2, int k) {       PriorityQueue<int[]> queue = new PriorityQueue<>((a,b)->a[0]+a[1]-b[0]-b[1]);       List<int[]> res = new ArrayList<>();        if(nums1.length==0 || nums2.length==0 || k==0) return res;        for(int i = 0; i < nums1.length && i < k; i++)            queue.offer(new int[]{nums1[i], nums2[0], 0});        while (k-- > 0 && !queue.isEmpty()) {            int[] cur = queue.poll();            res.add(new int[]{cur[0], cur[1]});            if(cur[2] == nums2.length - 1) continue;            queue.offer(new int[]{cur[0] ,nums2[cur[2] + 1], cur[2] + 1});        }        return res;    }}