LeetCode 696 Count Binary Substrings (模拟)

最新推荐文章于 2022-12-18 23:59:01 发布

_TCgogogo_

最新推荐文章于 2022-12-18 23:59:01 发布

阅读量274

点赞数

分类专栏： Leetcode Easy LeetCode 文章标签：模拟

本文链接：https://blog.csdn.net/Tc_To_Top/article/details/87869174

版权

LeetCode 同时被 2 个专栏收录

334 篇文章 5 订阅

订阅专栏

Leetcode Easy

48 篇文章 0 订阅

订阅专栏

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.

题目链接：https://leetcode.com/problems/count-binary-substrings/

题目分析：本质上就是算出连续0和1的个数，然后两两取小求和，实际上只需关心当前连续数字的个数和前一个连续数字的个数

class Solution {
    public int countBinarySubstrings(String s) {
        int len = s.length(), cur = 1, pre = 0, ans = 0;
        for (int i = 0; i < len - 1; i++) {
            if (s.charAt(i) == s.charAt(i + 1)) {
                cur++;
            } else {
                pre = cur;
                cur = 1;
            }
            if (pre >= cur) {
                ans++;
            }
        }
        return ans;
    }
}