LeetCode --- 1018. Binary Prefix Divisible By 5 解题报告

Posted 杨鑫newlfe

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode --- 1018. 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], then x0 = 1x1 = 2, and x2 = 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]
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 = 

以上是关于LeetCode --- 1018. Binary Prefix Divisible By 5 解题报告的主要内容,如果未能解决你的问题,请参考以下文章

LeetCode --- 1018. Binary Prefix Divisible By 5 解题报告

LeetCode --- 1018. Binary Prefix Divisible By 5 解题报告

Leetcode 1018. Binary Prefix Divisible By 5

LeetCode.1018-可被5整除的二进制数(Binary Prefix Divisible By 5)

timus 1018. Binary Apple Tree

URAL1018 Binary Apple Tree