## Description

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] = [a`

represents that a point exists at _{i}, b_{i}]`(a`

. A point is _{i}, b_{i})**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*. If there are no valid points, return

**smallest**index`-1`

.The **Manhattan distance** between two points `(x`

and _{1}, y_{1})`(x`

is _{2}, y_{2})`abs(x`

._{1} - x_{2}) + abs(y_{1} - y_{2})

**Example 1:**

Input:x = 3, y = 4, points = [[1,2],[3,1],[2,4],[2,3],[4,4]]Output:2Explanation: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:0Explanation: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:-1Explanation:There are no valid points.

**Constraints:**

`1 <= points.length <= 10`

^{4}`points[i].length == 2`

`1 <= x, y, a`

_{i}, b_{i}<= 10^{4}

## Explanation

Find valid points first, then calculate distances.

## Python Solution

```
class Solution:
def nearestValidPoint(self, x: int, y: int, points: List[List[int]]) -> int:
valid_points = []
for i, point in enumerate(points):
if point[0] == x or point[1] == y:
valid_points.append([point[0], point[1], i])
min_distance = [sys.maxsize, -1]
for point in valid_points:
distance = abs(point[0] - x) + abs(point[1] - y)
if distance < min_distance[0]:
min_distance[0] = distance
min_distance[1] = point[2]
return min_distance[1]
```

- Time Complexity: O(N)
- Space Complexity: O(N)