#1513

Number of Substrings With Only 1s

specialist · 750 · lc medium +31 · verified · 57.4% accepted · 1,231 likes · top 53%

Description

Given a binary string s, find the total count of substrings consisting entirely of 1s. Because the result may be large, return it modulo 10⁹ + 7.

Example 1:

Input: s = "0110111"

Output: 9

Explanation: There are 9 substring in total with only 1's characters.

"1" -> 5 times.

"11" -> 3 times.

"111" -> 1 time.

Example 2:

Input: s = "101"

Output: 2

Explanation: Substring "1" is shown 2 times in s.

Example 3:

Input: s = "111111"

Output: 21

Explanation: Each substring contains only 1's characters.

Code

1

2

3

class Solution:
    def numSub(self, s: str) -> int:

class Solution:
    def numSub(self, s: str) -> int: