# 清风的技术小屋

0%

## 问题描述

Give a string s, count the number of non-empty (contiguous) 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:

Example 2:

Note:

• s.length will be between 1 and 50,000.

• s will only consist of "0" or "1" characters.

Related Topics: String