leetcode-1018. 可被 5 整除的二进制前缀

class Solution {
	public List<Boolean> prefixesDivBy5(int[] A) {
		int curSum = 0;
		List<Boolean> res = new ArrayList<>();
		for (int i = 0; i < A.length; ++i) {
			curSum = (curSum * 2 + A[i]) % 5;// 前缀转换为10进制
			if (curSum == 0)
				res.add(true);
			else
				res.add(false);
		}
		return res;
	}
}