[LeetCode]Count Binary Substrings
作者是 在线疯狂 发布于 2017年10月15日 在 LeetCode.

题目描述：

LeetCode 696. 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 between 1 and 50,000.
• s will only consist of "0" or "1" characters.

题目大意：

给定01串，求0和1元素个数相等的子串个数，并且满足0和1分别分组存在。

解题思路：

一趟遍历

Python代码：

class Solution(object):
    def countBinarySubstrings(self, s):
        """
        :type s: str
        :rtype: int
        """
        size = len(s)
        cnt = [0, 0]
        last = None
        ans = 0
        for c in s:
            c = int(c)
            if c != last: cnt[c] = 0
            cnt[c] += 1
            if cnt[c] <= cnt[1 - c]: ans += 1
            last = c
        return ans

 

本文链接：https://bookshadow.com/weblog/2017/10/15/leetcode-count-binary-substrings/
请尊重作者的劳动成果，转载请注明出处！书影博客保留对文章的所有权利。