【Leetcode】1513. Number of Substrings With Only 1s

题目地址：

https://leetcode.com/problems/number-of-substrings-with-only-1s/description/

给定一个长$n$的$01$字符串$s$，问其$1$子串总共有多少个。答案模$10^9+7$返回。

代码如下：

class Solution {
 public:
  using ll = long long;
  int numSub(string s) {
    constexpr int MOD = 1e9 + 7;
    ll res = 0;
    for (int i = 0; i < s.size(); i++) {
      if (s[i] == '1') {
        int j = i;
        while (j < s.size() && s[j] == '1') j++;
        res = (res + (ll)(j - i) * (j - i + 1) / 2) % MOD;
        i = j;
      }
    }
    return (int)res;
  }
};

时间复杂度$O(n)$，空间$O(1)$。