逻辑:
这道题的思路比较简单,就是按照除法的思路来,每一步都考虑是否可以整除和是否有余数即可,代码如下
class Solution {
public:
vector<int> divisibilityArray(string word, int m) {
int n = word.length();
vector<int> ans(n, 0);
long long num, pre = 0;
for(int i = 0; i < n; i++){
num = pre * 10 + word[i] - '0';
if(num % m == 0) ans[i] = 1;
pre = num % m;
}
return ans;
}
};