LeetCode --- 1437. Check If All 1‘s Are at Least Length K Places Away 解题报告
Posted 杨鑫newlfe
tags:
篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了LeetCode --- 1437. 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.
Const
以上是关于LeetCode --- 1437. Check If All 1‘s Are at Least Length K Places Away 解题报告的主要内容，如果未能解决你的问题，请参考以下文章