2025-08-22发表2025-08-22更新算法竞赛几秒读完 (大约70个字)全 0 子数组的数目12345678910111213141516171819func zeroFilledSubarray(nums []int) int64 { m := len(nums) dp := make([]int, m) res := int64(0) for i := 0; i < m; i++ { if nums[i] == 0 { if i > 0 { dp[i] = dp[i-1] + 1 } else { dp[i] = 1 } res += int64(dp[i]) } else { dp[i] = 0 } } return res}1234567891011121314func zeroFilledSubarray(nums []int) int64 { m := len(nums) var res, dp int64 for i:=0;i<m;i++ { if nums[i] == 0 { dp++ } else { dp=0 } res =res+ dp } return res}全 0 子数组的数目https://blog.jiejaitt.top/posts/fa760346.html作者JIeJaitt发布于2025-08-22更新于2025-08-22许可协议