子串能表示从 1 到 N 数字的二进制串

/*
 * Problem Statement: 
 * Given a binary string 's' and a positive integer 'n', 
 * return true if for every integer in the range [1, n], 
 * its binary representation is a substring of 's'. Otherwise, return false.
 * 
 * Approach using Java Stream: 
 * 1. Utilize IntStream to iterate through each integer from 1 to n.
 * 2. Convert each integer to its binary representation.
 * 3. Check if the binary representation is a substring of 's'.
 * 4. If all binary representations are found, return true; otherwise, return false.
 */

import java.util.stream.IntStream;

public class Solution {
    public boolean queryString(String s, int n) {
        return IntStream.rangeClosed(1, n)
                .mapToObj(Integer::toBinaryString) // Convert each integer to binary
                .allMatch(s::contains); // Check if all binary representations are in s
    }
}