2575. 找出字符串的可整除数组 【整数的字符串 竖式除法计算模拟】

2575. 找出字符串的可整除数组

class Solution:
    def divisibilityArray(self, word: str, m: int) -> List[int]:

        res = []
        cur = 0
        for c in word:
            cur = (cur * 10 + int(c)) % m # 重要： 只取 前面计算的余值  类似于  厂式除法计算流程
            res.append(1 if cur == 0 else 0)
        return res 

class Solution {
public:
    vector<int> divisibilityArray(string word, int m) {
        vector<int> res;
       long long cur = 0;
        for (char &c : word){
            cur = (cur * 10 + c - '0') % m;
            res.emplace_back(cur == 0 ? 1 : 0);
        }
        return res;        
    }
};