Count Lattice Points Inside a Circle LeetCode solution in C++

1
class Solution {
2
 public:
3
  bool circle(int x, int y, int c1, int c2, int r) {
4
    if ((x - c1) * (x - c1) + (y - c2) * (y - c2) <= r * r) return true;
5
    return false;
6
  }
7

8
  int countLatticePoints(vector<vector<int>> &circles) {
9
    int n = circles.size(), ans = 0;
10
    set<pair<int, int>> set;
11
    for (auto v : circles) {
12
      int r = v[2], x = v[0], y = v[1];
13
      for (int i = x - r; i <= x + r; i++)
14
        for (int j = y - r; j <= y + r; j++)
15
          if (circle(i, j, x, y, r)) {
16
            pair<int, int> p(i, j);
17
            set.insert(p);
18
          }
19
    }
20
    return set.size();
21
  }
22
};