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

Author: tan-wei

src/solution/mod.rs

@@ -1340,3 +1340,4 @@ mod s1773_count_items_matching_a_rule;
 mod s1774_closest_dessert_cost;
 mod s1775_equal_sum_arrays_with_minimum_number_of_operations;
 mod s1776_car_fleet_ii;
+mod s1779_find_nearest_point_that_has_the_same_x_or_y_coordinate;

src/solution/s1779_find_nearest_point_that_has_the_same_x_or_y_coordinate.rs

@@ -0,0 +1,87 @@
+/**
+ * [1779] 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 <= 10^4
+ * 	points[i].length == 2
+ * 	1 <= x, y, ai, bi <= 10^4
+ *
+ */
+pub struct Solution {}
+
+// problem: https://leetcode.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate/
+// discuss: https://leetcode.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate/discuss/?currentPage=1&orderBy=most_votes&query=
+
+// submission codes start here
+
+impl Solution {
+    pub fn nearest_valid_point(x: i32, y: i32, points: Vec<Vec<i32>>) -> i32 {
+        points
+            .into_iter()
+            .enumerate()
+            .filter(|(_, point)| point[0] == x || point[1] == y)
+            .min_by_key(|(_, point)| x.abs_diff(point[0]) + y.abs_diff(point[1]))
+            .map_or(-1, |(i, _)| i as i32)
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_1779_example_1() {
+        let x = 3;
+        let y = 4;
+        let points = vec![vec![1, 2], vec![3, 1], vec![2, 4], vec![2, 3], vec![4, 4]];
+
+        let result = 2;
+
+        assert_eq!(Solution::nearest_valid_point(x, y, points), result);
+    }
+
+    #[test]
+    fn test_1779_example_2() {
+        let x = 3;
+        let y = 4;
+        let points = vec![vec![3, 4]];
+
+        let result = 0;
+
+        assert_eq!(Solution::nearest_valid_point(x, y, points), result);
+    }
+
+    #[test]
+    fn test_1779_example_3() {
+        let x = 3;
+        let y = 4;
+        let points = vec![vec![2, 3]];
+
+        let result = -1;
+
+        assert_eq!(Solution::nearest_valid_point(x, y, points), result);
+    }
+}