Leetcode 696. Count Binary Subst

作者: SnailTyan | 来源:发表于2021-05-06 16:39 被阅读0次

Leetcode 696. Count Binary Subst
Leetcode PHP题解--D88 696. Count B
LeetCode笔记：696. Count Binary Sub
696. Count Binary Substrings
696. Count Binary Substrings
696. Count Binary Substrings
[刷题防痴呆] 0696 - 计数二进制子串 (Count Bi
LeetCode之Count Binary Substrings
【leetcode】76. 最小覆盖子串
LeetCode算法题-Count Binary Substri

文章作者：Tyan
博客：noahsnail.com | CSDN | 简书

1. Description

Count Binary Substrings

2. Solution

Version 1

class Solution:
    def countBinarySubstrings(self, s: str) -> int:
        length = len(s)
        count = 0
        pre = 0
        curr = 1
        for i in range(1, length):
            if s[i] == s[i - 1]:
                curr += 1
            else:
                count += min(pre, curr)
                pre = curr
                curr = 1
        count += min(pre, curr)
        return count

Reference

https://leetcode.com/problems/count-binary-substrings/

网友评论

Leetcode

本文标题：Leetcode 696. Count Binary Subst

本文链接：https://www.haomeiwen.com/subject/ijeddltx.html

延伸阅读

深度阅读

您也可以注册成为美文阅读网的作者，发表您的原创作品、分享您的心情！

Leetcode 696. Count Binary Subst

1. Description

2. Solution

Reference

相关文章

Leetcode 696. Count Binary Subst

Leetcode PHP题解--D88 696. Count B

LeetCode笔记：696. Count Binary Sub

696. Count Binary Substrings

696. Count Binary Substrings

696. Count Binary Substrings

[刷题防痴呆] 0696 - 计数二进制子串 (Count Bi

LeetCode之Count Binary Substrings

【leetcode】76. 最小覆盖子串

LeetCode算法题-Count Binary Substri

网友评论

延伸阅读

深度阅读

栏目导航

热点阅读

Leetcode