Longer Contiguous Segments of Ones than Zeros LeetCode solution in Python

1
# Runtime: 47 ms (Top 65.12%) | Memory: 13.9 MB (Top 66.60%)
2
class Solution:
3
    def checkZeroOnes(self, s: str) -> bool:
4
        s1 = s.split("0")
5
        s0 = s.split("1")
6
        r1 = max([len(i) for i in s1])
7
        r0 = max([len(i) for i in s0])
8
        return r1 > r0