首页 > itarticle > [leetcode] problem 696 – count binary substrings

[leetcode] problem 696 – count binary substrings

admin 11月 13, 2020 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

No.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.

No.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.

Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
 
public int (String s) {
    int result = 0;
    int prev = 0;
    int current = 1;

    for (int i = 1; i < s.length(); i++) {
        if (s.charAt(i) != s.charAt(i - 1)) {
            prev = current;
            current = 1;
        }
        else
            current++;

        if (current <= prev)
            result++;
    }

    return result;
}
微海报分享

近期文章

近期评论

标签

热门

文章归档

分类目录

功能