Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 696 with 20 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 696 # by problem number
lcpy gen -s count_binary_substrings # by problem name
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.
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.
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.
class Solution:
# Time: O(n)
# Space: O(1)
def count_binary_substrings(self, s: str) -> int:
prev = 0
cur = 1
total = 0
for i in range(1, len(s)):
if s[i] == s[i - 1]:
cur += 1
else:
total += min(prev, cur)
prev = cur
cur = 1
total += min(prev, cur)
return total
| Time | Space |
|---|---|
| O(n) | O(1) |