Leetcode——696. Count Binary Substrings

最新推荐文章于 2022-05-06 14:43:01 发布

想当厨子的程序媛

最新推荐文章于 2022-05-06 14:43:01 发布

阅读量333

点赞数

分类专栏： LeetCode_String 文章标签： 696. Count Binary Substrings Leetcode

本文链接：https://blog.csdn.net/xiaojie_570/article/details/79665662

版权

LeetCode 同时被 2 个专栏收录

141 篇文章 1 订阅

订阅专栏

LeetCode_String

30 篇文章 0 订阅

订阅专栏

题目原址

https://leetcode.com/problems/count-binary-substrings/description/

题目描述

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.

Example1:

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.

Example2:

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:
1. s.length will be between 1 and 50,000.
2. s will only consist of “0” or “1” characters.

解题思路

preRun代表当前元素前面0的个数
curRun代表当前元素1的个数
当preRun的值大于等于curRun的值时，说明当前值0的个数大于等于1的个数
，因此要增加count值

AC代码

class Solution {
    public int countBinarySubstrings(String s) {
        int count = 0;
        int preRun = 0;
        int curRun = 1;
        for(int i = 1; i < s.length(); i++) {
            if(s.charAt(i) == s.charAt(i-1))
                curRun++;
            else {
                preRun = curRun;
                curRun = 1;
            }
            if(preRun >= curRun)
                count++;
        }
        return count; 
    }
}