Count the Number of Substrings With Dominant Ones
You are given a binary string s.
Return the number of substrings with dominant ones.
A string has dominant ones if the number of ones in the string is greater than or equal to the square of the number of zeros in the string.
Example 1
Input
s = "00011"Output
5The substrings with dominant ones are
1 at index 3, 1 at index 4, 01, 11, and 011, for a total of 5.Example 2
Input
s = "101101"Output
16There are 21 substrings total and 5 of them have non-dominant ones, so there are 16 substrings with dominant ones.
Constraints
- 1 <= s.length <= 4 * 10^4
- s consists only of characters '0' and '1'.