1779. Find Nearest Point That Has the Same X or Y Coordinate LeetCode Solution
In this guide, you will get 1779. Find Nearest Point That Has the Same X or Y Coordinate LeetCode Solution with the best time and space complexity. The solution to Find Nearest Point That Has the Same X or Y Coordinate problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.
Problem Statement of 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 <= 104
points[i].length == 2
1 <= x, y, ai, bi <= 104
Complexity Analysis
Time Complexity: O(n)
Space Complexity: O(n)
1779. Find Nearest Point That Has the Same X or Y Coordinate LeetCode Solution in C++
class Solution {
public:
int nearestValidPoint(int x, int y, vector<vector<int>>& points) {
int ans = -1;
int minDist = INT_MAX;
for (int i = 0; i < points.size(); ++i) {
const int dx = x - points[i][0];
const int dy = y - points[i][1];
if (dx == 0 || dy == 0) {
const int dist = abs(dx + dy);
if (dist < minDist) {
minDist = dist;
ans = i;
}
}
}
return ans;
}
}; /* code provided by PROGIEZ */
1779. Find Nearest Point That Has the Same X or Y Coordinate LeetCode Solution in Java
class Solution {
public int nearestValidPoint(int x, int y, int[][] points) {
int ans = -1;
int minDist = Integer.MAX_VALUE;
for (int i = 0; i < points.length; ++i) {
final int dx = x - points[i][0];
final int dy = y - points[i][1];
if (dx == 0 || dy == 0) {
final int dist = Math.abs(dx + dy);
if (dist < minDist) {
minDist = dist;
ans = i;
}
}
}
return ans;
}
} // code provided by PROGIEZ
1779. Find Nearest Point That Has the Same X or Y Coordinate LeetCode Solution in Python
