网址:https://leetcode.com/problems/binary-prefix-divisible-by-5/
一次for循环遍历数组,在上次计算的基础上得到本次的结果!
1 class Solution { 2 public: 3 vector<bool> prefixesDivBy5(vector<int>& A) 4 { 5 vector<bool> ans; 6 int num = 0; 7 int pre_num = 0; 8 for(int i=0; i<A.size(); i++) 9 { 10 num = 0; 11 num += pre_num * 2 + A[i]; 12 num = num % 5; 13 pre_num = num; 14 if(num % 5 == 0) 15 { 16 ans.push_back(true); 17 } 18 else 19 ans.push_back(false); 20 } 21 return ans; 22 } 23 };