Today I have done leetcode's November LeetCoding Challenge with cpp.

November LeetCoding Challenge 17

Description

Check If All 1's Are at Least Length K Places Away

Given an binary array nums 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.

Constraints:

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

Solution

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

// Accepted
// 69/69 cases passed (0 ms)
// Your runtime beats 100 % of cpp submissions
// Your memory usage beats 47.64 % of cpp submissions (61.5 MB)