leetcode 1828. Queries on Number of Points Inside a Circle

Problem: 1828. 统计一个circle中点的数目计算距离即可Codeclass Solution { public: bool dist(vectorint a, vectorint c) { int x a[0] - c[0]; int y a[1] - c[1]; int dit (x * x) (y * y); bool ans sqrt((double)dit) (double)c[2]; return ans; } vectorint countPoints(vectorvectorint points, vectorvectorint queries) { int n points.size(), m queries.size(), sum; vectorint ret; for(vectorint q : queries) { sum 0; for(int j 0; j n; j) { if(dist(points[j], q)) { sum; } } ret.push_back(sum); } return ret; } };