Package g1001_1100.s1018_binary_prefix_divisible_by_5

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1018 - Binary Prefix Divisible By 5\.

    Easy

    You are given a binary array nums ( 0-indexed ).

    We define <code>x<sub>i</sub></code> 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], then <code>x<sub>0</sub> = 1</code>, <code>x<sub>1</sub> = 2</code>, and <code>x<sub>2</sub> = 5</code>.

    Return an array of booleans answer where answer[i] is true if <code>x<sub>i</sub></code> 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 answer0 is true.

    Example 2:

    Input: nums = 1,1,1

    Output: false,false,false

    Constraints:

    • <code>1 <= nums.length <= 10<sup>5</sup></code>

    • nums[i] is either 0 or 1.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final List<Boolean> prefixesDivBy5(IntArray nums)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait