Check If All 1’s Are at Least Length K Places Away
给一个数组, 里面是0和1, 求里面的1互相之间是否至少隔k个数.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 |
class Solution { public: bool kLengthApart(vector<int>& nums, int k) { vector<int> v; for(int i = 0; i < nums.size(); i++) { if(nums[i] == 1) v.push_back(i); } for(int i = 1; i < v.size(); i++) { if(v[i] - v[i - 1] <= k) return false; } return true; } }; |