Check If All 1's Are at Least Length K Places Away LeetCode solution in C++

1
class Solution {
2
 public:
3
  bool kLengthApart(vector<int> &nums, int k) {
4
    bool once = true;
5
    int x = 0;
6
    int diff = 0;
7
    for (int i = 0; i < nums.size(); i++) {
8
      if (nums[i] == 1 and once) {
9
        x = i;
10
        once = false;
11
      } else if (nums[i] == 1) {
12
        diff = i - x;
13
        if (diff - 1 < k) return false;
14
        x = i;
15
      }
16
    }
17
    return true;
18
  }
19
};