Easy C++ Solution ✔
Here is my C++ Solution :-\n\nclass Solution {\npublic:\n    int nearestValidPoint(int x, int y, vector<vector<int>>& points) {\n        int val= -1; int v= INT
Here is my C++ Solution :-\n```\nclass Solution {\npublic:\n    int nearestValidPoint(int x, int y, vector<vector<int>>& points) {\n        int val= -1; int v= INT_MAX;\n        for (int i=0; i<points.size(); i++){\n            if (x!=points[i][0] && y!= points[i][1])continue;\n            if (v > (abs(points[i][0]-x)+abs(points[i][1]-y))){\n                val= i; \n                v=(abs(points[i][0]-x)+abs(points[i][1]-y));}\n        }\n        return val;\n    }\n};\n```
['Array', 'Math', 'C', 'C++']