Binary Prefix Divisible By 5 LeetCode solution in Java

1
class Solution {
2
  public List<Boolean> prefixesDivBy5(int[] nums) {
3
    List<Boolean> list = new ArrayList<>();
4
    int sum = 0;
5
    for (int i = 0; i < nums.length; i++) {
6
      sum = (sum * 2 + nums[i]) % 5;
7
      if (sum == 0) list.add(true);
8
      else list.add(false);
9
    }
10
    return list;
11
  }
12
}