Problem · String
Count Binary Substrings
A binary string is a string consisting only of 0s and 1s. A substring is a contiguous group of characters within a string.
Given a binary string, find the number of substrings that contain an equal number of 0s and 1s and all the 0s and 1s are grouped together. Note that duplicate substrings are also counted in the answer. For example, '0011' has two overlapping substrings that meet the criteria: '0011' and '01'.
Complete the function getSubstringCount in the editor.
getSubstringCount has the following parameter(s):
s: a binary string
Returns
int: the number of substrings that meet the criteria
Examples
01 · Example 1
s = "011001" return = 4
The substrings '01', '10', '1100', and '01' have equal numbers of 0s and 1s with all 0s and 1s grouped consecutively. Hence, the answer is 4. Note that the substring '0110' has an equal number of 0s and 1s but is not counted because not all 0s and 1s are grouped together.
Constraints
- The length of
s≤ 10^5 - The string consists of 0s and 1s only.
More Dell problems
public int getSubstringCount(String s) {
// write your code here
}
s"011001"
expected4
sign in to submit