标签：Nearest Point int point 1779 points dx dy valid
原题链接在这里：https://leetcode.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate/
题目：
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 that a point exists at (ai, bi). A point is valid if it shares the same x-coordinate or the same y-coordinate as your location.
Return the index (0-indexed) of the valid point with the smallest Manhattan distance from your current location. If there are multiple, return the valid point with the smallest index. If there are no valid points, return -1.
The Manhattan distance between two points (x1, y1) and (x2, y2) is abs(x1 - x2) + abs(y1 - y2).
Example 1:
Input: x = 3, y = 4, points = [[1,2],[3,1],[2,4],[2,3],[4,4]] Output: 2 Explanation: 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.
Example 2:
Input: x = 3, y = 4, points = [[3,4]] Output: 0 Explanation: The answer is allowed to be on the same location as your current location.
Example 3:
Input: x = 3, y = 4, points = [[2,3]] Output: -1 Explanation: There are no valid points.
Constraints:
1 <= points.length <= 104points[i].length == 21 <= x, y, ai, bi <= 104
题解：
Check each point, get dx = point[0] - x, dy = point[1] - y;
if dx == 0 or dy == 0, then we find a candidate. Now we already assume that dx or dy is 0. Then manhattan distance could be simple as Math.abs(dx + dy).
Time Complexity: O(n). n = points.length.
Space: O(1).
AC Java:
1 class Solution {
2 public int nearestValidPoint(int x, int y, int[][] points) {
3 int res = -1;
4 int min = Integer.MAX_VALUE;
5 for(int i = 0; i < points.length; i++){
6 int dx = x - points[i][0];
7 int dy = y - points[i][1];
8 if(dx * dy == 0 && Math.abs(dx + dy) < min){
9 min = Math.abs(dx + dy);
10 res = i;
11 }
12 }
13
14 return res;
15 }
16 }
标签：Nearest,Point,int,point,1779,points,dx,dy,valid 来源： https://www.cnblogs.com/Dylan-Java-NYC/p/16634674.html
本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享； 2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关； 3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关； 4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除； 5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。