{"id":980,"date":"2021-03-13T00:41:51","date_gmt":"2021-03-12T16:41:51","guid":{"rendered":"http:\/\/lonelinerd.com\/?p=980"},"modified":"2021-03-13T01:33:04","modified_gmt":"2021-03-12T17:33:04","slug":"leetcode-1461","status":"publish","type":"post","link":"https:\/\/lonelinerd.com\/index.php\/2021\/03\/13\/leetcode-1461\/","title":{"rendered":"[LeetCode\u5237\u984c\u7b46\u8a18] 1461 – Check If a String Contains All Binary Codes of Size K"},"content":{"rendered":"\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t
\n\t\t\t\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t
\n\t\t\t\t

\u984c\u76ee\u63cf\u8ff0\uff1a<\/strong><\/span><\/h4>

Given a binary string <\/span>s<\/code><\/span> and an integer <\/span>k<\/code><\/span>.<\/span><\/p>

Return <\/span>True<\/span><\/em><\/span> if every binary code of length <\/span>k<\/code><\/span> is a substring of <\/span>s<\/code><\/span>. Otherwise, return <\/span>False<\/span><\/em><\/span>.<\/span><\/p>

\u00a0<\/p>

Example 1:<\/span><\/strong><\/span><\/p>

Input: s = \"00110110\", k = 2<\/span>
Output: true<\/span>
Explanation: The binary codes of length 2 are \"00\", \"01\", \"10\" and \"11\". They can be all found as substrings at indicies 0, 1, 3 and 2 respectively.<\/span><\/pre>
Example 2:<\/span><\/strong><\/span><\/p>
Input: s = \"00110\", k = 2<\/span>
Output: true<\/span><\/pre>
Example 3:<\/span><\/strong><\/span><\/p>
Input: s = \"0110\", k = 1<\/span>
Output: true<\/span>
Explanation: The binary codes of length 1 are \"0\" and \"1\", it is clear that both exist as a substring. <\/span><\/pre>
Example 4:<\/span><\/strong><\/span><\/p>
Input: s = \"0110\", k = 2<\/span>
Output: false<\/span>
Explanation: The binary code \"00\" is of length 2 and doesn't exist in the array.<\/span><\/pre>
Example 5:<\/span><\/strong><\/span><\/p>
Input: s = \"0000000001011100\", k = 4<\/span>
Output: false<\/span><\/pre>
\u00a0<\/p>
Constraints:<\/span><\/strong><\/span><\/p>