LeetCode 솔루션 분류
[5/31] 1461. Check If a String Contains All Binary Codes of Size K
본문
1461. Check If a String Contains All Binary Codes of Size K
Medium
179083Add to ListShareGiven a binary string s and an integer k, return true if every binary code of length k is a substring of s. Otherwise, return false.
Example 1:
Input: s = "00110110", k = 2 Output: true Explanation: The binary codes of length 2 are "00", "01", "10" and "11". They can be all found as substrings at indices 0, 1, 3 and 2 respectively.
Example 2:
Input: s = "0110", k = 1 Output: true Explanation: The binary codes of length 1 are "0" and "1", it is clear that both exist as a substring.
Example 3:
Input: s = "0110", k = 2 Output: false Explanation: The binary code "00" is of length 2 and does not exist in the array.
Constraints:
1 <= s.length <= 5 * 105s[i]is either'0'or'1'.1 <= k <= 20
관련자료
-
링크
댓글 1
Coffee님의 댓글
- 익명
- 작성일
class Solution {
public boolean hasAllCodes(String s, int k) {
HashSet<String> checked = new HashSet<>();
// 2 -> binary cases - 00 01 10 11
for(int i=0; i<= s.length() - k; i++){
checked.add(s.substring(i, i+k));
}
return checked.size() == 1 << k;
}
}
