zoukankan      html  css  js  c++  java
  • 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.



    参考 https:
    //www.cnblogs.com/immjc/p/7678304.html ``` class Solution { public: int countBinarySubstrings(string s) { int pre = 0, cur = 1, res = 0; for (int i = 1; i != s.size(); i++) { if (s[i] == s[i - 1]) { cur++; } else { pre = cur; cur = 1; } if (pre >= cur) res++; } return res; } }; ```
    python代码
    ```
    class Solution(object):
        def countBinarySubstrings(self, s):
            """
            :type s: str
            :rtype: int
            """
            pre,cur,cnt=0,1,0
            for i in range(1,len(s)):
                if s[i]==s[i-1]:
                    cur+=1
                else:
                    pre=cur
                    cur=1
                    
                if pre>=cur:
                    cnt+=1
                    
            return cnt
            
    ```
  • 相关阅读:
    SpringBoot实现原理
    常见Http状态码大全
    forward(转发)和redirect(重定向)有什么区别
    1094. Car Pooling (M)
    0980. Unique Paths III (H)
    1291. Sequential Digits (M)
    0121. Best Time to Buy and Sell Stock (E)
    1041. Robot Bounded In Circle (M)
    0421. Maximum XOR of Two Numbers in an Array (M)
    0216. Combination Sum III (M)
  • 原文地址:https://www.cnblogs.com/learning-c/p/9271596.html
Copyright © 2011-2022 走看看