diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/check_string_cont_k.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/check_string_cont_k.cpp')
-rw-r--r-- | other/check_string_cont_k.cpp | 30 |
1 files changed, 0 insertions, 30 deletions
diff --git a/other/check_string_cont_k.cpp b/other/check_string_cont_k.cpp deleted file mode 100644 index e041052..0000000 --- a/other/check_string_cont_k.cpp +++ /dev/null @@ -1,30 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - bool hasAllCodes(string s, int k) { - int bitLimit = 1 << k, n = 0; - bool combos[bitLimit]; - for (int i = 0; i < bitLimit; i++) - combos[i] = true; - for (int i = 0, limit = k - 1; i < limit; i++) - n = (n << 1) + (s[i] == '1'); - for (int i = k - 1, limit = s.size(), total = bitLimit; i < limit; i++) { - n = (n << 1) + (s[i] == '1'); - if (n >= bitLimit) - n -= bitLimit; - if (combos[n]) - combos[n] = false, total--; - if (!total) - return true; - } - return false; - } -}; - -int main() { - Solution obj; - string s = "00110110"; - int k = 2; - cout << obj.hasAllCodes(s, k); -} |