696. Count Binary Substrings
来源:互联网 发布:js 屏蔽运营商广告 编辑:程序博客网 时间:2024/05/17 23:07
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: 6Explanation: 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: 4Explanation: There are 4 substrings: "10", "01", "10", "01" that have equal number of consecutive 1's and 0's.此题主要需要明白问题核心可以简化问题 ,观察1100、11100、1100000,可以看到零一配对的一组数,根据题目规则能得到的个数受零或一的个数中最小的影响,即以上三个数组都是2.因此问题转化为,取两个相邻连续零或一个数中最小的值加到最后的总和中。
那么循环设置为遍历数组,与第一个数字相同值时计数,遇到不同值时开辟新的计数,再下次遇到与第二次的不同值时选出最小的计数加到和中。将第二次计数赋给第一个计数器,重复接下来的步骤。
class Solution {public: int countBinarySubstrings(string s) { int size = s.size(); if(size==0) return 0; char now=s[0]; int l = 1; int ll = 0; int sum=0; for(int i=1;i<size;i++){ if(s[i]==now){ if(ll!=0){ sum += (l>ll? ll:l); now = s[i-1]; l=ll; ll=1; continue; } l++; } else{ ll++; } } sum += (l>ll? ll:l); return sum; }};
阅读全文
0 0
- 696. Count Binary Substrings
- 696. Count Binary Substrings
- 696. Count Binary Substrings
- 696. Count Binary Substrings
- leetcode 696. Count Binary Substrings
- leetcode-696. Count Binary Substrings
- leetcode 696. Count Binary Substrings
- leetcode 696. Count Binary Substrings
- LWC 54:696. Count Binary Substrings
- leetcode题解-696. Count Binary Substrings
- Count Binary Substrings(leetcode)
- leetcode 696 Count Binary Substrings
- python--leetcode696. Count Binary Substrings
- Count Binary Substrings问题及解法
- LeetCode-Easy-Java-Count Binary Substrings
- LeetCode之Count Binary Substrings(Kotlin)
- Codechef Count Substrings
- 451 D. Count Good Substrings
- linux磁盘共享nfs及iscsi
- 三子棋
- 普及练习场 交叉模拟 税收与补贴问题
- 定积分的基本性质4 绝对可积性
- 程序员面试宝典随笔记(一)--多态性
- 696. Count Binary Substrings
- Prim(各种功能)
- 数据结构实验之查找三:树的种类统计
- 数据结构2
- 24 迭代器分类对算法的影响(学自Boolean)
- MySQL数据库——创建计算字段
- 【TensorFlow】MNIST(代码重构+模型持久化)
- 程序员面试宝典随笔记(一)--动态和静态绑定
- Oracle Profile 使用详解