1779. Find Nearest Point That Has the Same X or Y Coordinate

EasyArray
Leetcode Link

Problem Description

You are provided with your current coordinates (x, y) on a Cartesian grid. Additionally, you are given a list of points, each represented by a pair of coordinates [a_i, b_i]. A point is considered valid if it has either the same x-coordinate as yours (shares the same vertical line) or the same y-coordinate (shares the same horizontal line). The goal is to find the closest valid point to you based on the Manhattan distance. The Manhattan distance between two points (x_1, y_1) and (x_2, y_2) is given by abs(x_1 - x_2) + abs(y_1 - y_2), where abs stands for the absolute value function.

You need to return the smallest 0-indexed position of a point from the list that is valid and has the smallest Manhattan distance from your current location. If there is more than one valid point at the same minimum distance, return the one with the smallest index. If no valid points exist, return -1.

Intuition

To solve this problem, the straightforward approach is to iterate through the list of points, check for the conditions of validity (same x-coordinate or y-coordinate), and calculate the Manhattan distance between each valid point and your current coordinates.

While iterating, two things must be done:

  1. Check if the current point is valid by comparing its coordinates with your coordinates (x, y).
  2. If valid, compute the Manhattan distance to the current point.

We maintain two variables, mi to track the minimum distance found so far, and ans to store the index of the point with that minimum distance. By default, mi is set to infinity (inf) as we are looking for the minimum distance, and ans is set to -1 in case there are no valid points.

Each time we find a valid point with a Manhattan distance less than mi, we update mi with that distance and ans with the current index.

After iterating through all points, we simply return ans, which holds the index of the nearest valid point, or -1 if no valid point was found.

Not Sure What to Study? Take the 2-min Quiz to Find Your Missing Piece：

Which two pointer technique does Quick Sort use?

Solution Approach

The implementation of the solution uses a simple iterative approach with none of the more advanced algorithms or patterns. The main data structures used are the Python list to hold the points and a tuple to work with individual point coordinates.

Here's the breakdown of the implementation:

  1. Initialize ans variable to -1. This will hold the index of the closest valid point, and if it stays -1, it means no valid point was found.

  2. Initialize mi variable to inf (stands for infinity in Python), which will keep track of the smallest Manhattan distance found during iteration.

  3. Iterate over each point using enumerate to get both the index i and the coordinates (a, b).

  4. Check if the current point is valid by comparing either the x-coordinate or the y-coordinate with the current location. This is done with the condition if a == x or b == y:.

  5. If the point is valid, compute its Manhattan distance from the current location with d = abs(a - x) + abs(b - y).

  6. Compare the calculated distance d with the current minimum distance mi. If d is smaller, update mi to the new minimum distance and ans to the current index.

  7. After exiting the loop, return ans, which represents the index of the point with the smallest Manhattan distance, or -1 if no valid point was found.

This approach ensures that we are only considering valid points and always choose the valid point that is closest to the current location. Furthermore, since we update ans only when we find a closer valid point, if there are multiple points with the same distance, the first one found (and thus with the smallest index) will be chosen, consistent with the problem's requirement.

Discover Your Strengths and Weaknesses: Take Our 2-Minute Quiz to Tailor Your Study Plan:

Given an array of 1,000,000 integers that is almost sorted, except for 2 pairs of integers. Which algorithm is fastest for sorting the array?

Example Walkthrough

Let's consider an example to illustrate the solution approach:

  • Your current coordinates: (1, 2)
  • List of points: [[0, 3], [1, 9], [2, 3], [1, 4], [0, 2]]

Following the steps outlined in the solution approach:

  1. Initialize ans to -1.

  2. Initialize mi to inf.

  3. Start iterating over the list of points:

    • Index 0, Point [0, 3]: It's not valid since neither 0 == 1 nor 3 == 2. Move to the next point.
    • Index 1, Point [1, 9]: This point is valid because it shares the same x-coordinate as yours (1 == 1). Calculate the Manhattan distance: d = abs(1 - 1) + abs(9 - 2) = 7. As d is smaller than mi, update mi to 7 and ans to 1.
    • Index 2, Point [2, 3]: It's not valid since neither 2 == 1 nor 3 == 2. Move to the next point.
    • Index 3, Point [1, 4]: This point is valid (1 == 1). Calculate the Manhattan distance: d = abs(1 - 1) + abs(4 - 2) = 2. Update mi to 2 and ans to 3 since 2 is smaller than the current mi of 7.
    • Index 4, Point [0, 2]: This point is valid (2 == 2). Calculate the Manhattan distance: d = abs(0 - 1) + abs(2 - 2) = 1. Update mi to 1 and ans to 4 since 1 is smaller than the current mi of 2.

  4. Finish the iteration.

  5. Return ans which is 4 as this is the point [0, 2] with the smallest Manhattan distance from your current location (1, 2).

Using this example, we can see that the solution methodology effectively finds the closest valid point from the given list. It also displays that if multiple valid points have the same minimum distance, it shall return the point with the smallest index.

Solution Implementation

1from typing import List
2
3class Solution:
4    def nearestValidPoint(self, x: int, y: int, points: List[List[int]]) -> int:
5        # Initialize the variable for the closest point index to -1 (no valid points by default)
6        closest_index = -1  
7        # Initialize the variable for the minimum distance to infinity
8        min_distance = float('inf')  
9      
10        # Loop through each point and its index in the given list of points
11        for index, (point_x, point_y) in enumerate(points):
12            # Check if the current point is on the same x or y coordinate as the reference point (x, y)
13            if point_x == x or point_y == y:
14                # Calculate the Manhattan distance between the current point and the reference point
15                distance = abs(point_x - x) + abs(point_y - y)
16                # Check if the calculated distance is less than the current minimum distance
17                if distance < min_distance:
18                    # Update the closest index and minimum distance to the current index and distance
19                    closest_index, min_distance = index, distance
20      
21        # Return the index of the nearest valid point
22        return closest_index
23
1class Solution {
2
3    public int nearestValidPoint(int x, int y, int[][] points) {
4        int nearestIndex = -1; // Initialize the nearest valid point index with -1
5        int minimumDistance = Integer.MAX_VALUE; // Initialize minimum distance with maximum possible integer value
6      
7        for (int i = 0; i < points.length; ++i) {
8            int currentX = points[i][0]; // Get the x-coordinate of the current point
9            int currentY = points[i][1]; // Get the y-coordinate of the current point
10          
11            // Check if the current point is on the same x-axis or y-axis as the reference point (x,y)
12            if (currentX == x || currentY == y) {
13                int currentDistance = Math.abs(currentX - x) + Math.abs(currentY - y); // Calculate Manhattan distance from (x,y)
14              
15                // If the current distance is less than the previously recorded minimum distance
16                if (currentDistance < minimumDistance) {
17                    minimumDistance = currentDistance; // Update minimum distance
18                    nearestIndex = i; // Update the index of the nearest valid point
19                }
20            }
21        }
22      
23        return nearestIndex; // Return the index of the nearest valid point, or -1 if no valid point exists
24    }
25}
26
1#include <vector>       // Include necessary header for vector
2#include <cmath>        // Include cmath for the abs function
3using namespace std;    // Use the standard namespace
4
5class Solution {
6public:
7    // Function to find the nearest valid point to the point (x, y)
8    // points: a 2D vector containing the other points' coordinates
9    int nearestValidPoint(int x, int y, vector<vector<int>>& points) {
10        int closestIndex = -1;              // Initialize closest point index as -1 (not found)
11        int minDistance = INT_MAX;          // Initialize the minimum distance with a high value
12        for (int i = 0; i < points.size(); ++i) {
13            int currentX = points[i][0];    // X-coordinate of the current point
14            int currentY = points[i][1];    // Y-coordinate of the current point
15            // Check if the point is on the same axis as (x, y)
16            if (currentX == x || currentY == y) {
17                // Calculate the Manhattan distance between (x, y) and the current point
18                int dist = abs(currentX - x) + abs(currentY - y);
19                // If the distance is less than the minimum distance found so far
20                if (dist < minDistance) {
21                    minDistance = dist;      // Update the minimum distance
22                    closestIndex = i;        // Update the index of the closest point
23                }
24            }
25        }
26        return closestIndex; // Return the index of the closest point, or -1 if no point is valid
27    }
28};
29
1function nearestValidPoint(x: number, y: number, points: number[][]): number {
2    let nearestPointIndex = -1; // Initialized with -1 to indicate no valid point has been found
3    let minimumDistance = Infinity; // Initialized to the largest possible value
4
5    // Iterate over each point to find the valid nearest point
6    points.forEach((point, index) => {
7        const [pointX, pointY] = point; // Extract the x and y coordinates of the current point
8
9        // Skip points that are not on the same x or y coordinate as the given point (x, y)
10        if (pointX !== x && pointY !== y) {
11            return; // Continue to the next iteration
12        }
13
14        // Calculate the Manhattan distance between the given point (x, y) and the current point
15        const distance = Math.abs(pointX - x) + Math.abs(pointY - y);
16
17        // If the current distance is less than the minimum found so far, update the result
18        if (distance < minimumDistance) {
19            minimumDistance = distance; // Update the minimum distance
20            nearestPointIndex = index; // Update the index of the nearest valid point
21        }
22    });
23
24    return nearestPointIndex; // Return the index of the nearest valid point or -1 if none found
25}
26
Not Sure What to Study? Take the 2-min Quiz：

Which of the following array represent a max heap?

Time and Space Complexity

Time Complexity

The time complexity of the code is O(n), where n is the number of points in the input list points. This is because the function iterates through the list of points exactly once, performing a constant amount of work for each point by checking whether the point is valid and calculating the Manhattan distance if necessary.

Space Complexity

The space complexity of the code is O(1). The extra space used by the algorithm includes a fixed number of integer variables (ans, mi, a, b, d), which do not depend on the size of the input. Since the amount of extra space required does not scale with the input size, the space complexity is constant.

Learn more about how to find time and space complexity quickly using problem constraints.

Fast Track Your Learning with Our Quick Skills Quiz:

Which of the following is a min heap?

Recommended Readings

LeetCode Patterns - Top Patterns for Coding Interviews

Top Patterns to Conquer the Technical Coding Interview Should the written word bore you fear not A delightful video alternative awaits iframe width 560 height 315 src https www youtube com embed LW8Io6IPYHw title YouTube video player frameborder 0 allow accelerometer autoplay clipboard write encrypted media gyroscope picture in picture

Recursion Review

Recursion Recursion is one of the most important concepts in computer science Simply speaking recursion is the process of a function calling itself Using a real life analogy imagine a scenario where you invite your friends to lunch https algomonster s3 us east 2 amazonaws com recursion jpg You first

Runtime to Algo Cheat Sheet

Runtime Overview When learning about algorithms and data structures you'll frequently encounter the term time complexity This concept is fundamental in computer science and offers insights into how long an algorithm takes to complete given a certain input size What is Time Complexity Time complexity represents the amount of time

Got a question? Ask the Teaching Assistant anything you don't understand.

Still not clear? Ask in the Forum,  Discord or Submit the part you don't understand to our editors.

←
↑TA 👨‍🏫