LeetCode 0696. Count Binary Substrings Solution in Java, C++, Python & More | Explanation + Code

Description

Given a binary string s, return the number of non-empty substrings that have the same number of 0's and 1's, and all the 0's and all the 1's in these substrings are grouped consecutively.

Substrings that occur multiple times are counted the number of times they occur.

 

Example 1:

Input: s = "00110011"
Output: 6
Explanation: There are 6 substrings that have equal number of consecutive 1's and 0's: "0011", "01", "1100", "10", "0011", and "01".
Notice that some of these substrings repeat and are counted the number of times they occur.
Also, "00110011" is not a valid substring because all the 0's (and 1's) are not grouped together.

Example 2:

Input: s = "10101"
Output: 4
Explanation: There are 4 substrings: "10", "01", "10", "01" that have equal number of consecutive 1's and 0's.

 

Constraints:

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

Solutions

Solution 1: Iteration and Counting

We can iterate through the string s, using a variable pre to record the count of the previous consecutive characters, and another variable cur to record the count of the current consecutive characters. The number of valid substrings ending with the current character is min(pre, cur). We accumulate min(pre, cur) to the answer, assign the value of cur to pre, and continue iterating through string s until the end.

The time complexity is O(n), where n is the length of string s. The space complexity is O(1).

PythonJavaC++GoTypeScriptRust

class Solution: def countBinarySubstrings(self, s: str) -> int: n = len(s) ans = i = 0 pre = 0 while i < n: j = i + 1 while j < n and s[j] == s[i]: j += 1 cur = j - i ans += min(pre, cur) pre = cur i = j return ans(code-box)

class Solution { public int countBinarySubstrings(String s) { int n = s.length(); int ans = 0; int i = 0; int pre = 0; while (i < n) { int j = i + 1; while (j < n && s.charAt(j) == s.charAt(i)) { j++; } int cur = j - i; ans += Math.min(pre, cur); pre = cur; i = j; } return ans; } }(code-box)

class Solution { public: int countBinarySubstrings(string s) { int n = s.size(); int ans = 0; int i = 0; int pre = 0; while (i < n) { int j = i + 1; while (j < n && s[j] == s[i]) { ++j; } int cur = j - i; ans += min(pre, cur); pre = cur; i = j; } return ans; } };(code-box)

func countBinarySubstrings(s string) (ans int) { n := len(s) i := 0 pre := 0 for i < n { j := i + 1 for j < n && s[j] == s[i] { j++ } cur := j - i ans += min(pre, cur) pre = cur i = j } return }(code-box)

function countBinarySubstrings(s: string): number { const n = s.length; let ans = 0; let i = 0; let pre = 0; while (i < n) { let j = i + 1; while (j < n && s[j] === s[i]) { j++; } const cur = j - i; ans += Math.min(pre, cur); pre = cur; i = j; } return ans; }(code-box)

impl Solution { pub fn count_binary_substrings(s: String) -> i32 { let bytes = s.as_bytes(); let n: usize = bytes.len(); let mut ans: i32 = 0; let mut i: usize = 0; let mut pre: i32 = 0; while i < n { let mut j: usize = i + 1; while j < n && bytes[j] == bytes[i] { j += 1; } let cur: i32 = (j - i) as i32; ans += pre.min(cur); pre = cur; i = j; } ans } }(code-box)