{"id":8447,"date":"2021-05-08T23:48:26","date_gmt":"2021-05-09T06:48:26","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=8447"},"modified":"2021-05-08T23:49:35","modified_gmt":"2021-05-09T06:49:35","slug":"leetcode-1855-maximum-distance-between-a-pair-of-values","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/two-pointers\/leetcode-1855-maximum-distance-between-a-pair-of-values\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 1855. Maximum Distance Between a Pair of Values"},"content":{"rendered":"\n

You are given two non-increasing 0-indexed <\/strong>integer arrays nums1<\/code>\u200b\u200b\u200b\u200b\u200b\u200b and nums2<\/code>\u200b\u200b\u200b\u200b\u200b\u200b.<\/p>\n\n\n\n

A pair of indices (i, j)<\/code>, where 0 <= i < nums1.length<\/code> and 0 <= j < nums2.length<\/code>, is valid<\/strong> if both i <= j<\/code> and nums1[i] <= nums2[j]<\/code>. The distance<\/strong> of the pair is j - i<\/code>\u200b\u200b\u200b\u200b.<\/p>\n\n\n\n

Return the maximum distance<\/strong> of any valid<\/strong> pair <\/em>(i, j)<\/code>. If there are no valid pairs, return <\/em>0<\/code>.<\/p>\n\n\n\n

An array arr<\/code> is non-increasing<\/strong> if arr[i-1] >= arr[i]<\/code> for every 1 <= i < arr.length<\/code>.<\/p>\n\n\n\n

Example 1:<\/strong><\/p>\n\n\n\n

Input:<\/strong> nums1 = [55,30,5,4,2], nums2 = [100,20,10,10,5]\nOutput:<\/strong> 2\nExplanation:<\/strong> The valid pairs are (0,0), (2,2), (2,3), (2,4), (3,3), (3,4), and (4,4).\nThe maximum distance is 2 with pair (2,4).\n<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
Input:<\/strong> nums1 = [2,2,2], nums2 = [10,10,1]\nOutput:<\/strong> 1\nExplanation:<\/strong> The valid pairs are (0,0), (0,1), and (1,1).\nThe maximum distance is 1 with pair (0,1).\n<\/pre>\n\n\n\n
Example 3:<\/strong><\/p>\n\n\n\n
Input:<\/strong> nums1 = [30,29,19,5], nums2 = [25,25,25,25,25]\nOutput:<\/strong> 2\nExplanation:<\/strong> The valid pairs are (2,2), (2,3), (2,4), (3,3), and (3,4).\nThe maximum distance is 2 with pair (2,4).\n<\/pre>\n\n\n\n
Example 4:<\/strong><\/p>\n\n\n\n
Input:<\/strong> nums1 = [5,4], nums2 = [3,2]\nOutput:<\/strong> 0\nExplanation:<\/strong> There are no valid pairs, so return 0.\n<\/pre>\n\n\n\n
Constraints:<\/strong><\/p>\n\n\n\n
  • 1 <= nums1.length <= 105<\/sup><\/code><\/li>
  • 1 <= nums2.length <= 105<\/sup><\/code><\/li>
  • 1 <= nums1[i], nums2[j] <= 105<\/sup><\/code><\/li>
  • Both nums1<\/code> and nums2<\/code> are non-increasing<\/strong>.<\/li><\/ul>\n\n\n\n
    Solution: Two Pointers<\/strong><\/h2>\n\n\n\n
    For each i, find the largest j such that nums[j] >= nums[i].<\/p>\n\n\n\n
    Time complexity: O(n + m)
    Space complexity: O(1)<\/p>\n\n\n\n
    \n
    C++<\/h2>\n
    \n\n
    \n\/\/ Author: Huahua\nclass Solution {\npublic:\n  int maxDistance(vector& nums1, vector& nums2) {    \n    int ans = 0;\n    for (int i = 0, j = -1; i < nums1.size(); ++i) {\n      while (j + 1 < nums2.size() && nums2[j + 1] >= nums1[i]) ++j;\n      if (j >= i) ans = max(ans, j - i);\n    }\n    return ans;\n  }\n};\n<\/pre>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"
    You are given two non-increasing 0-indexed integer arrays nums1\u200b\u200b\u200b\u200b\u200b\u200b and nums2\u200b\u200b\u200b\u200b\u200b\u200b. A pair of indices (i, j), where 0 <= i < nums1.length and 0 <= j < nums2.length, is valid if both i <= j and nums1[i]…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[176],"tags":[177,175],"class_list":["post-8447","post","type-post","status-publish","format-standard","hentry","category-two-pointers","tag-medium","tag-two-pointers","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/8447","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/comments?post=8447"}],"version-history":[{"count":2,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/8447\/revisions"}],"predecessor-version":[{"id":8449,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/8447\/revisions\/8449"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=8447"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=8447"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=8447"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}