class Solution {
public:
    int nearestValidPoint(int x, int y, vector<vector<int>>& points) {
        int minDis = INT_MAX;
        int ans = 0;
        for(int i=0;i<points.size();i++)
        {
            if(x == points[i][0] || y == points[i][1])
            {
                int dis = abs(points[i][0]-x) + abs(points[i][1] - y);
                if(minDis > dis)
                {
                    minDis = dis;
                    ans = i;
                }
            }
        }

        return minDis == INT_MAX ? -1 :  ans;
    }
};