Leetcode 1018. Binary Prefix Divisible By 5

文章作者：Tyan
博客：noahsnail.com  |  CSDN  |  简书

1. Description

2. Solution

解析：Version 1，每次数组索引向右移动，相当于当前数字左移一位，因此当前数值应在上一数值的基础上乘以2，加上当前位。

• Version 1

class Solution:
    def prefixesDivBy5(self, nums: List[int]) -> List[bool]:
        n = len(nums)
        pre = 0
        result = [0] * n
        for i in range(n):
            current = pre * 2 + nums[i]
            #current = (pre << 1) + nums[i]
            result.append(current % 5 == 0)
            pre = current
        return result

Reference

1. https://leetcode.com/problems/binary-prefix-divisible-by-5/