1513. 仅含 1 的子串数(LeetCode-力扣-Python)

最新推荐文章于 2024-07-22 16:27:42 发布

zy20221209

最新推荐文章于 2024-07-22 16:27:42 发布

阅读量286

点赞数 8

文章标签： leetcode 算法 python

本文链接：https://blog.csdn.net/zy20221209/article/details/136869595

版权

class Solution(object):
    def numSub(self, s):
        """
        :type s: str
        :rtype: int
        """
        t= 10**9 + 7
        arr = list(s)
        arr.append(0)
        brr = []
        num = 0
        flag = 0
        for i in range(len(arr)):
            temp = int(arr[i])
            if temp == 1:
                flag = 1
                num += 1
            if flag == 1:
                if temp == 0:
                    brr.append(num)
                    num = 0
                    flag = 0

        brr.sort(reverse=True)
        result = 0
        for val in brr:

            sum1 = sum(range(1, val+1))
            result += sum1
        return result%t