• Skip to primary navigation
  • Skip to content
  • Skip to footer
zhicheng xie's demo blog
  • Quick-Start Guide

    Your Name

    I am an amazing person.

    • Somewhere

    Longer Contiguous Segments of Ones than Zeros

    less than 1 minute read

    <-E 1869> Longer Contiguous Segments of Ones than Zeros

    class Solution {
    public:
        bool checkZeroOnes(string s) {
            int zmax = 0,omax = 0; 
            int zcnt = 0,ocnt = 0; 
            for(char i : s){  
                if(i == '1'){  
                   omax = max(omax, ++ocnt);
                   zcnt = 0;
                } 
                else{  
                  zmax = max(zmax, ++zcnt); 
                   ocnt = 0;
                }
            }   
            return omax > zmax;
        }
    };
    

    Tags: Algorithms, C++, Leetcode

    Updated: April 15, 2022

    Share on

    Twitter Facebook LinkedIn
    Previous Next

    You may also enjoy

    Decode Ways

    less than 1 minute read

    <-M 91> Decode Ways

    Word Break

    less than 1 minute read

    <-H 139> Word Break

    Distinct Subsequences

    less than 1 minute read

    <-H 115> Distinct Subsequences

    Edit Distance

    less than 1 minute read

    <-H 72> Edit Distance

    • Follow:
    • Feed
    © 2023 zhicheng xie's blog. Powered by Jekyll & Minimal Mistakes.