You are given two 0-indexed integer arrays
nums1andnums2of the same length. A pair of indices(i,j)is called beautiful if|nums1[i] - nums1[j]| + |nums2[i] - nums2[j]|is the smallest amongst all possible indices pairs wherei < j.Return the beautiful pair. In the case that there are multiple beautiful pairs, return the lexicographically smallest pair.
Note that
|x|denotes the absolute value ofx.- A pair of indices
(i1, j1)is lexicographically smaller than(i2, j2)ifi1 < i2ori1 == i2andj1 < j2.