leetcode题解-696. Count Binary Substrings

最新推荐文章于 2022-08-01 07:18:46 发布

liuchongee

最新推荐文章于 2022-08-01 07:18:46 发布

阅读量3.6k

点赞数 1

分类专栏： leetcode刷题 Leetcode刷题总结--java 文章标签： string leetcode

本文链接：https://blog.csdn.net/liuchonge/article/details/78452948

版权

本文详细介绍了如何解决LeetCode中的696题，即计算01二进制字符串中连续且0和1数量相等的子串。文章从暴力解法入手，然后逐步优化，提出了利用堆的概念、转化为数组遍历以及降低空间复杂度的方法，最终提供了一种能击败94%用户的高效解决方案。

摘要由CSDN通过智能技术生成

从今天开始刷字符串部分的题目，这部分我会记录每一题的简短思路，方便最后写一个总结性的博客。接下来先看一下第一道题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: