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

找出字符串的可整除数组

解法一: 模运算

go
1
2
3
4
5
6
7
8
9
10
11
12
func divisibilityArray(word string, m int) []int {
n := len(word)
ans := make([]int, n)
cur := 0
for i, ch := range word {
cur = (cur*10 + int(ch-'0')) % m
if cur == 0 {
ans[i] = 1
}
}
return ans
}
作者

wuhunyu

发布于

2024-03-07

更新于

2025-01-15

许可协议