Solution: Kth Smallest Product of Two Sorted Arrays
Solution: Kth Smallest Product of Two Sorted Arrays asks you to find the k-th smallest product formed by pairing values from two sorted arrays, which may contain negatives and zero.
We'll cover the following...
We'll cover the following...
Statement
You are given two sorted nums1 and nums2, along with an integer k.
Consider all possible products formed by nums1[i] * nums2[j], where i ranges over all valid indices of nums1 and j ranges over all valid indices of nums2. Return the
Note: Both
nums1andnums2are sorted in non-decreasing order. The arrays may contain negative numbers and zero, so the products can be negative, zero, or positive.
Constraints:
nums1.length,nums2.lengthnums1[i],nums2[j]...