Number of Substrings With Only 1s
-
[Algo Rhythm🕺💃] LeetCode - Number of Substrings With Only 1sAlgo Rhythm🕺💃/LeetCode 2020. 7. 19. 17:34
📚 Problem description Given a binary string s (a string consisting only of '0' and '1's). Return the number of substrings with all characters 1's. Since the answer may be too large, return it modulo 10^9 + 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"..