[leetcode]String-696. Count Binary Substrings

Posted chenhan05

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[leetcode]String-696. Count Binary Substrings相关的知识,希望对你有一定的参考价值。

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.

class Solution {  
 2 public:  
 3     int countBinarySubstrings(string s) {  
 4         vector<int> vec ;  
 5         int res = 0 ;  
 6         int count = 1 ;  
 7         for(int i = 1 ; i <= s.size() ; i++){  
 8             if (s[i] == s[i-1]){  
 9                 count++ ;  
10             }else{  
11                 vec.push_back(count) ;  
12                 count = 1 ;  
13             }  
14         }  
15         for(int i = 1 ; i < vec.size() ; i++){  
16             res += min(vec[i],vec[i-1]) ;  
17         }  
18         return res ;  
19     }  
20 };  

 

以上是关于[leetcode]String-696. Count Binary Substrings的主要内容,如果未能解决你的问题,请参考以下文章