Count Binary Substrings
题目
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:
Input: "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: "10101"
Output: 4
Explanation: There are 4 substrings: "10", "01", "10", "01" that have equal number of consecutive 1's and 0's.
Note:
s.length
will be between1
and50,000
.s
will only consist of “0” or “1” characters.
解决
因为字符串中只有0
和1
,因此分别记录出现的0
或者1
的个数。
(1) 00110011
,则记录的数据为2、2、2、2
,所以结果为2 + 2 + 2 = 6
。
(2) 00111001
,则记录的数据为2、3、2、1
,所以结果为2 + 2 + 1 = 5
。
class Solution {
public:
int countBinarySubstrings(string s) {
int result = 0;
int len = s.length();
vector<int> temp;
int count = 1;
for (int i = 0; i < len; i++) {
if (s[i] == s[i + 1]) {
count++;
} else {
temp.push_back(count);
count = 1;
}
}
int num = temp.size();
for (int i = 1; i < num; i++) {
result += min(temp[i - 1], temp[i]);
}
return result;
}
};