Binary Prefix Divisible By 5
You are given a binary array nums (0-indexed).
We define xi as the number whose binary representation is the subarray nums[0..i] from most-significant-bit to least-significant-bit.
- For example, if
nums = [1, 0, 1], thenx0 = 1,x1 = 2, andx2 = 5.
Return an array of booleans answer where answer[i] is true if xi is divisible by 5.
Example 1
Input
nums = [0,1,1]Output
[true,false,false]The input numbers in binary are 0, 01, 011, which are 0, 1, and 3 in base 10, so only the first number is divisible by 5.
Example 2
Input
nums = [1,1,1]Output
[false,false,false]The prefixes 1, 11, and 111 are 1, 3, and 7 in base 10, and none is divisible by 5.
Constraints
- 1 <= nums.length <= 10^5
- nums[i] is either 0 or 1.