{"id":8192,"date":"2021-03-06T09:02:48","date_gmt":"2021-03-06T17:02:48","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=8192"},"modified":"2021-03-06T09:04:49","modified_gmt":"2021-03-06T17:04:49","slug":"leetcode-1779-find-nearest-point-that-has-the-same-x-or-y-coordinate","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/geometry\/leetcode-1779-find-nearest-point-that-has-the-same-x-or-y-coordinate\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 1779. Find Nearest Point That Has the Same X or Y Coordinate"},"content":{"rendered":"\n

You are given two integers, x<\/code> and y<\/code>, which represent your current location on a Cartesian grid: (x, y)<\/code>. You are also given an array points<\/code> where each points[i] = [ai<\/sub>, bi<\/sub>]<\/code> represents that a point exists at (ai<\/sub>, bi<\/sub>)<\/code>. A point is valid<\/strong> if it shares the same x-coordinate or the same y-coordinate as your location.<\/p>\n\n\n\n

Return the index (0-indexed)<\/strong> of the valid<\/strong> point with the smallest Manhattan distance<\/strong> from your current location<\/em>. If there are multiple, return the valid point with the smallest<\/strong> index<\/em>. If there are no valid points, return -1<\/code>.<\/p>\n\n\n\n

The Manhattan distance<\/strong> between two points (x1<\/sub>, y1<\/sub>)<\/code> and (x2<\/sub>, y2<\/sub>)<\/code> is abs(x1<\/sub> - x2<\/sub>) + abs(y1<\/sub> - y2<\/sub>)<\/code>.<\/p>\n\n\n\n

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

Input:<\/strong> x = 3, y = 4, points = [[1,2],[3,1],[2,4],[2,3],[4,4]]\nOutput:<\/strong> 2\nExplanation:<\/strong> Of all the points, only [3,1], [2,4] and [4,4] are valid. Of the valid points, [2,4] and [4,4] have the smallest Manhattan distance from your current location, with a distance of 1. [2,4] has the smallest index, so return 2.<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
Input:<\/strong> x = 3, y = 4, points = [[3,4]]\nOutput:<\/strong> 0\nExplanation:<\/strong> The answer is allowed to be on the same location as your current location.<\/pre>\n\n\n\n
Example 3:<\/strong><\/p>\n\n\n\n
Input:<\/strong> x = 3, y = 4, points = [[2,3]]\nOutput:<\/strong> -1\nExplanation:<\/strong> There are no valid points.<\/pre>\n\n\n\n
Constraints:<\/strong><\/p>\n\n\n\n
  • 1 <= points.length <= 104<\/sup><\/code><\/li>
  • points[i].length == 2<\/code><\/li>
  • 1 <= x, y, ai<\/sub>, bi<\/sub> <= 104<\/sup><\/code><\/li><\/ul>\n\n\n\n
    Solution: Brute Force<\/strong><\/h2>\n\n\n\n
    Time complexity: O(n)
    Space complexity: O(1)<\/p>\n\n\n\n
    \n
    C++<\/h2>\n
    \n\n
    \n\/\/ Author: Huahua\nclass Solution {\npublic:\n  int nearestValidPoint(int x, int y, vector>& points) {\n    int min_dist = INT_MAX;\n    int ans = -1;\n    for (int i = 0; i < points.size(); ++i) {\n      const int dx = abs(points[i][0] - x);\n      const int dy = abs(points[i][1] - y);      \n      if (dx * dy == 0 && dx + dy < min_dist) {\n        min_dist = dx + dy;\n        ans = i;\n      }\n    }\n    return ans;\n  }\n};\n<\/pre>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"
    You are given two integers, x and y, which represent your current location on a Cartesian grid: (x, y). You are also given an array points where each points[i] = [ai, bi] represents…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[127],"tags":[20,222,284],"class_list":["post-8192","post","type-post","status-publish","format-standard","hentry","category-geometry","tag-array","tag-easy","tag-geometry","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/8192","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=8192"}],"version-history":[{"count":2,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/8192\/revisions"}],"predecessor-version":[{"id":8194,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/8192\/revisions\/8194"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=8192"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=8192"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=8192"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}