_1779.java

packagecom.fishercoder.solutions.secondthousand;

publicclass_1779 {
publicstaticclassSolution1 {
publicintnearestValidPoint(intx, inty, int[][] points) {
intnearestManDistance = Integer.MAX_VALUE;
intresult = -1;
for (inti = 0; i < points.length; i++) {
int[] point = points[i];
if (point[0] == x || point[1] == y) {
intdistance = Math.abs(point[0] - x) + Math.abs(point[1] - y);
if (distance < nearestManDistance) {
result = i;
nearestManDistance = distance;
 }
 }
 }
returnresult;
 }
 }
}