#1018

Binary Prefix Divisible By 5

pupil · 440 · lc easy +26 · verified · 53.5% accepted · 1,102 likes · top 45%

Description

You are given a binary array nums (0-indexed). For each index i, let xi be the number whose binary form is the prefix nums[0..i] (from most- to least-significant bit).

- For example, nums = [1,0,1] gives x0 = 1, x1 = 2, x2 = 5.

Return a boolean array answer where answer[i] is true if xi is divisible by 5.

Example 1:

Input: nums = [0,1,1]

Output: [true,false,false]

Explanation: The input numbers in binary are 0, 01, 011; which are 0, 1, and 3 in base-10.

Only the first number is divisible by 5, so answer[0] is true.

Example 2:

Input: nums = [1,1,1]

Output: [false,false,false]

Code

1

2

3

class Solution:
    def prefixesDivBy5(self, nums: List[int]) -> List[bool]:

class Solution:
    def prefixesDivBy5(self, nums: List[int]) -> List[bool]: