1016. Binary String With Substrings Representing 1 To N**

1016. Binary String With Substrings Representing 1 To N**

https://leetcode.com/problems/binary-string-with-substrings-representing-1-to-n/

题目描述

Given a binary string S (a string consisting only of '0' and '1's) and a positive integer N, return true if and only if for every integer X from 1 to N, the binary representation of X is a substring of S.

Example 1:

Input: S = "0110", N = 3
Output: true

Example 2:

Input: S = "0110", N = 4
Output: false

Note:

• 1 <= S.length <= 1000
• 1 <= N <= 10^9

C++ 实现 1

需要对 C++ 如何求一个数的 Binary 形式有所了解: 使用 #include <bitset> 提供的 std::bitset<m>(N).to_string() 实现. 比如, 若 N = 4, m = 32, 那么得到的二进制结果为 0.....0100, 即前面有很多个 0, 因此下面代码先使用 b.find("1") 找出第一个 1 出现的位置.

class Solution {
public:
    bool queryString(string S, int N) {
        while (N > 0) {
            string b = std::bitset<32>(N--).to_string();
            if (S.find(b.substr(b.find("1"))) == std::string::npos) return false;
        }
        return true;
    }
};