<p>You wrote down many <strong>positive</strong> integers in a string called <code>num</code>. However, you realized that you forgot to add commas to seperate the different numbers. You remember that the list of integers was <strong>non-decreasing</strong> and that <strong>no</strong> integer had leading zeros.</p>

<p>Return <em>the <strong>number of possible lists of integers</strong> that you could have written down to get the string </em><code>num</code>. Since the answer may be large, return it <strong>modulo</strong> <code>10<sup>9</sup> + 7</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> num = &quot;327&quot;
<strong>Output:</strong> 2
<strong>Explanation:</strong> You could have written down the numbers:
3, 27
327
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> num = &quot;094&quot;
<strong>Output:</strong> 0
<strong>Explanation:</strong> No numbers can have leading zeros and all numbers must be positive.
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> num = &quot;0&quot;
<strong>Output:</strong> 0
<strong>Explanation:</strong> No numbers can have leading zeros and all numbers must be positive.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= num.length &lt;= 3500</code></li>
	<li><code>num</code> consists of digits <code>&#39;0&#39;</code> through <code>&#39;9&#39;</code>.</li>
</ul>

class Solution:
    def numberOfCombinations(self, num: str) -> int:
        n = len(num)
        if n == 0 or num[0] == '0':
            return 0
        MOD = 10 ** 9 + 7
        lcp = [[0] * (n + 1) for _ in range(n + 1)]
        for i in range(n - 1, -1, -1):
            for j in range(n - 1, -1, -1):
                if num[i] == num[j]:
                    lcp[i][j] = lcp[i + 1][j + 1] + 1
        
        def is_greater(start1, start2, length):
            longest_cp = lcp[start1][start2]
            if longest_cp >= length:
                return True
            return num[start1 + longest_cp] >= num[start2 + longest_cp]

        dp = [[0] * n for _ in range(n + 1)]
        dp[n] = [1] * n
        for i in range(n - 1, -1, -1):
            for j in range(i - 1, -1, -1):
                cnt = 0
                if num[i] != '0':
                    k = 2 * i - j
                    if k <= n:
                        if is_greater(i, j, i - j):
                            cnt += dp[k][i]
                        elif k < n:
                            k += 1
                            cnt += dp[k][i]
                cnt += dp[i + 1][j]
                dp[i][j] = cnt % MOD

        return dp[1][0]
        
2339