-
Notifications
You must be signed in to change notification settings - Fork 22
Expand file tree
/
Copy path1018.binary-prefix-divisible-by-5.cpp
More file actions
45 lines (43 loc) · 1.13 KB
/
1018.binary-prefix-divisible-by-5.cpp
File metadata and controls
45 lines (43 loc) · 1.13 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
// Tag: Array, Bit Manipulation
// Time: O(N)
// Space: O(1)
// Ref: -
// Note: -
// 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 = 1, x1 = 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 = [1,1,1]
// Output: [false,false,false]
//
//
// Constraints:
//
// 1 <= nums.length <= 105
// nums[i] is either 0 or 1.
//
//
class Solution {
public:
vector<bool> prefixesDivBy5(vector<int>& nums) {
vector<bool> res;
long long total = 0;
for (auto &x: nums) {
total = (total * 2 + x) % 5;
res.push_back(total == 0);
}
return res;
}
};