• Skip to primary navigation
  • Skip to content
  • Skip to footer
zhicheng xie's demo blog
  • Quick-Start Guide

    Your Name

    I am an amazing person.

    • Somewhere

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

    less than 1 minute read

    <-E 1437> Check If All 1’s Are at Least Length K Places Away

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

    Tags: Algorithms, C++, Leetcode

    Updated: April 7, 2022

    Share on

    Twitter Facebook LinkedIn
    Previous Next

    You may also enjoy

    Decode Ways

    less than 1 minute read

    <-M 91> Decode Ways

    Word Break

    less than 1 minute read

    <-H 139> Word Break

    Distinct Subsequences

    less than 1 minute read

    <-H 115> Distinct Subsequences

    Edit Distance

    less than 1 minute read

    <-H 72> Edit Distance

    • Follow:
    • Feed
    © 2023 zhicheng xie's blog. Powered by Jekyll & Minimal Mistakes.