DataStructures-Algorithms/Leetcode Daily Challenge/January-2021/25. 1's Are at Least Length K Places Away.cpp at master · sachuverma/DataStructures-Algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
/*
1's Are at Least Length K Places Away
=====================================

Given an array nums of 0s and 1s and an integer k, return True if all 1's are at least k places away from each other, otherwise return False.

Example 1:
Input: nums = [1,0,0,0,1,0,0,1], k = 2
Output: true
Explanation: Each of the 1s are at least 2 places away from each other.

Example 2:
Input: nums = [1,0,0,1,0,1], k = 2
Output: false
Explanation: The second 1 and third 1 are only one apart from each other.

Example 3:
Input: nums = [1,1,1,1,1], k = 0
Output: true

Example 4:
Input: nums = [0,1,0,1], k = 1
Output: true

Constraints:
1 <= nums.length <= 105
0 <= k <= nums.length
nums[i] is 0 or 1

Hint #1
Each time you find a number 1, check whether or not it is K or more places away from the next one. If it's not, return false.
*/

class Solution
{
public:
  bool kLengthApart(vector<int> &nums, int k)
  {
    int c = k;
    for (int i = 0; i < nums.size(); ++i)
    {
      if (nums[i] == 1 && c < k)
        return false;
      if (nums[i] == 1 && c >= k)
        c = 0;
      else
        c++;
    }
    return true;
  }
};