Skip to content

Added Different Approach #18

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
champmaniac wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Added Different Approach #18

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
37 changes: 27 additions & 10 deletions Arrays/CheckAll1sAreAtLeastKPlacesAway.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,16 +1,33 @@
static auto fast=[]{ios_base::sync_with_stdio(false);cin.tie(nullptr);return 0;}();
// static auto fast=[]{ios_base::sync_with_stdio(false);cin.tie(nullptr);return 0;}();
// class Solution {
// public:
// bool kLengthApart(vector<int>& nums, int k) {
// int s=0;
// int c=0;
// while(s<nums.size()){
// if(nums[s]==1 && s!=0){
// if(c<k) return false;
// c=0;
// }if(nums[s]==0) c++;
// s++;
// }
// return true;
// }
// };
// In this particular code currently in Leetcode it's passing 67/68 testcases and as a whole it's giving wrong answer after submission.
// So, I have added a different approach!

class Solution {
public:
bool kLengthApart(vector<int>& nums, int k) {
int s=0;
int c=0;
while(s<nums.size()){
if(nums[s]==1 && s!=0){
if(c<k) return false;
c=0;
}if(nums[s]==0) c++;
s++;
if (!k) return true;
// parsing nums
for (int i = 0, j = 0, len = nums.size(); i < len; i++) {
// element == 1 && not enough distance from the previous
if (nums[i] && j > 0) return false;
// otherwise we either reset or decrease j
else j = nums[i] ? k : j - 1;
}
return true;
}
};
};