1018. Binary Prefix Divisible By 5*
https://leetcode.com/problems/binary-prefix-divisible-by-5/
题目描述
Given an array A
of 0
s and 1
s, consider N_i
: the i-th
subarray from A[0]
to A[i]
interpreted as a binary number (from most-significant-bit to least-significant-bit.)
Return a list of booleans answer, where answer[i]
is true
if and only if N_i
is divisible by 5
.
Example 1:
Input: [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: [1,1,1]
Output: [false,false,false]
Example 3:
Input: [0,1,1,1,1,1]
Output: [true,false,false,false,true,false]
Example 4:
Input: [1,1,1,0,1]
Output: [false,false,false,false,false]
Note:
1 <= A.length <= 30000
A[i]
is 0 or 1
C++ 实现 1
参看 Detailed Explanation using Modular Arithmetic O(n) 这个解答, 相当之详细. 大致思路如下, 先介绍几个前置概念:
- 假设当前访问
A[i - 1]
, 表示的数为old_number
, 那么当访问A[i]
时, 所表示的数new_number = old_number * 2 + A[]
; - 如果直接判断
new_number
是否能被 5 整除, 容易出现溢出的问题, 因为按照上面遍历的方式, C++ 只能保存32-bit
的数据, 但是题目中说明1 <= A.length <= 30000
. - 我们不需要知道具体的
new_number
数值大小, 而只需要它与 5 的余数; - 发现一个数学公式:
(a*b + c) % d = ((a%d)*(b%d) + c%d) % d
, 因此new_number % 5
可以表示为((old_number % 5) * 2 + A[i]) % 5
. - 由第 4 点, 可以将
number % 5
作为一个整体, 更新公式为a = (a * 2 + A[i]) % 5
.
class Solution {
public:
vector<bool> prefixesDivBy5(vector<int>& A) {
vector<bool> answer;
int old_number = 0;
for (int i = 0; i < A.size(); ++ i) {
old_number = ((old_number % 5) * 2 + A[i]) % 5;
answer.push_back(old_number == 0);
}
return answer;
}
};