Class Solution
-
- All Implemented Interfaces:
public final class Solution2040 - Kth Smallest Product of Two Sorted Arrays\.
Hard
Given two sorted 0-indexed integer arrays
nums1andnums2as well as an integerk, return the <code>k<sup>th</sup></code> ( 1-based ) smallest product ofnums1[i] * nums2[j]where0 <= i < nums1.lengthand0 <= j < nums2.length.Example 1:
Input: nums1 = 2,5, nums2 = 3,4, k = 2
Output: 8
Explanation: The 2 smallest products are:
nums10 \* nums20 = 2 \* 3 = 6
nums10 \* nums21 = 2 \* 4 = 8
The 2<sup>nd</sup> smallest product is 8.
Example 2:
Input: nums1 = -4,-2,0,3, nums2 = 2,4, k = 6
Output: 0
Explanation: The 6 smallest products are:
nums10 \* nums21 = (-4) \* 4 = -16
nums10 \* nums20 = (-4) \* 2 = -8
nums11 \* nums21 = (-2) \* 4 = -8
nums11 \* nums20 = (-2) \* 2 = -4
nums12 \* nums20 = 0 \* 2 = 0
nums12 \* nums21 = 0 \* 4 = 0
The 6<sup>th</sup> smallest product is 0.
Example 3:
Input: nums1 = -2,-1,0,1,2, nums2 = -3,-1,2,4,5, k = 3
Output: -6
Explanation: The 3 smallest products are:
nums10 \* nums24 = (-2) \* 5 = -10
nums10 \* nums23 = (-2) \* 4 = -8
nums14 \* nums20 = 2 \* (-3) = -6
The 3<sup>rd</sup> smallest product is -6.
Constraints:
<code>1 <= nums1.length, nums2.length <= 5 * 10<sup>4</sup></code>
<code>-10<sup>5</sup><= nums1i, nums2j<= 10<sup>5</sup></code>
1 <= k <= nums1.length * nums2.lengthnums1andnums2are sorted.
-
-
Nested Class Summary
Nested Classes Modifier and Type Class Description public classSolution.Companion
-
Field Summary
Fields Modifier and Type Field Description public final static Solution.CompanionCompanion
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
Modifier and Type Method Description final LongkthSmallestProduct(IntArray nums1, IntArray nums2, Long k)-
-
Method Detail
-
kthSmallestProduct
final Long kthSmallestProduct(IntArray nums1, IntArray nums2, Long k)
-
-
-
-