Leetcode 刷题之696. Count Binary Substrings

1.问题描述

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.

2.示例

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.

3.备注

Note:
s.length will be between 1 and 50,000.
s will only consist of “0” or “1” characters.

4.分析

当观察string时，可以将连续出现的1或者连续出现的0的个数记录下来，要出现0和1个数相等的情况，0核1谁在前谁在后无所谓。

• 以0011为例，那么可以得出01和0011两个答案，没有更多了。
• 若是011，那么只有01这个答案；
• 若是11100，那么只有10,1100两个答案。
  观察可以得出，这样的字符串的数量取决于相邻的01的字数个数少的那个。即11100有3个1,2个0，那么这样的字符串有两个，即Math.min(3,2);
  那么我们只要将字符串中01出现的次数统计，并比较大小求和即可。

5.代码

class Solution {
    public int countBinarySubstrings(String s) {
        int[] groups = new int[s.length()];
        int t = 0;
        groups[0] = 1;
        for(int i =1; i < s.length(); i++){
            if(s.charAt(i-1) != s.charAt(i)){
                groups[++t] = 1;
            }else{
                groups[t]++;
            }
        }
        
        int ans = 0;
        for (int i = 1; i <= t; i++){
            ans += Math.min(groups[i-1],groups[i]);
        }
        return ans;
    }
}

6.优化

两次的for循环是不是有点浪费呢？能不能一次做完呢？
why not？

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

上面是把01的个数存在了数组当中，这里不存，而是快速计算出结果，并把结果累加到ans中，最后只需要返回ans即可。