Package g1001_1100.s1018_binary_prefix_divisible_by_5

Class Solution

java.lang.Object

g1001_1100.s1018_binary_prefix_divisible_by_5.Solution

public class Solution
extends Object

1018 - Binary Prefix Divisible By 5.<p>Easy</p> <p>You are given a binary array <code>nums</code> ( <strong>0-indexed</strong> ).</p> <p>We define <code>x_i</code> as the number whose binary representation is the subarray <code>nums[0..i]</code> (from most-significant-bit to least-significant-bit).</p> <ul> <li>For example, if <code>nums = [1,0,1]</code>, then <code>x₀ = 1</code>, <code>x₁ = 2</code>, and <code>x₂ = 5</code>.</li> </ul> <p>Return <em>an array of booleans</em> <code>answer</code> <em>where</em> <code>answer[i]</code> <em>is</em> <code>true</code> <em>if</em> <code>x_i</code> <em>is divisible by</em> <code>5</code>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [0,1,1]</p> <p><strong>Output:</strong> [true,false,false]</p> <p><strong>Explanation:</strong> 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.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [1,1,1]</p> <p><strong>Output:</strong> [false,false,false]</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 10⁵</code></li> <li><code>nums[i]</code> is either <code>0</code> or <code>1</code>.</li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
List<Boolean>	prefixesDivBy5(int[] nums)

Methods inherited from class java.lang.Object

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

Constructor Details

Solution

public Solution()

Method Details

prefixesDivBy5

public List<Boolean> prefixesDivBy5(int[] nums)