好二进制字符串的数量

You are given a binary string s of length n and a positive integer k.

A substring of s is considered good if it contains at least k 1's.

Let nums[i] be the number of good substrings that start at index i. Return an integer array nums of length n such that nums[i] is the number of good substrings starting at index i.

A substring is a contiguous sequence of characters within a string.

Example 1:

Input: s = "1101101", k = 2
Output: [6,5,0,4,3,0,0]
Explanation: Consider s = "1101101" and k = 2:
- For i = 0: the good substrings starting at this index are "11", "110", "1101", "11011", "110110", "1101101", so nums[0] = 6.
- For i = 1: the good substrings starting at this index are "10", "101", "1011", "10110", "101101", so nums[1] = 5.
- For i = 2: there are no good substrings starting at this index, so nums[2] = 0.
- For i = 3: the good substrings starting at this index are "11", "110", "1101", "11011", so nums[3] = 4.
- For i = 4: the good substrings starting at this index are "11", "110", "1101", so nums[4] = 3.
- For i = 5: there are no good substrings starting at this index, so nums[5] = 0.
- For i = 6: there are no good substrings starting at this index, so nums[6] = 0.

Example 2:

Input: s = "10101", k = 3
Output: [0,0,0,0,0]
Explanation: Consider s = "10101" and k = 3:
- For i = 0: there are no good substrings starting at this index, so nums[0] = 0.
- For i = 1: there are no good substrings starting at this index, so nums[1] = 0.
- For i = 2: there are no good substrings starting at this index, so nums[2] = 0.
- For i = 3: there are no good substrings starting at this index, so nums[3] = 0.
- For i = 4: there are no good substrings starting at this index, so nums[4] = 0.

Constraints:

• 1 <= s.length <= 105
• 1 <= k <= 105
• s[i] is either '0' or '1'.