LeetCode --- 696. Count Binary Substrings 解题报告

最新推荐文章于 2024-09-25 10:36:42 发布

杨鑫newlfe

最新推荐文章于 2024-09-25 10:36:42 发布

阅读量243

点赞数

分类专栏： Python 算法 LeetCode 文章标签： LeetCode Python 算法

本文链接：https://blog.csdn.net/u012965373/article/details/106484589

版权

算法同时被 3 个专栏收录

825 篇文章 1324 订阅 ¥9.90 ¥99.00

订阅专栏

Python

659 篇文章 1574 订阅 ¥9.90 ¥99.00

订阅专栏

LeetCode

413 篇文章 5 订阅

订阅专栏

本文详细介绍了LeetCode第696题的解题报告，该题要求计算给定字符串中具有相同数量连续0和1的非空子串的数量。所有0和1必须连续出现。示例和注意事项帮助理解问题，并提供了Python解决方案。

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

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</

了解本专栏