number-of-ways-to-separate-numbers

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You wrote down many positive 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 non-decreasing and that no integer had leading zeros.

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

&nbsp;
Example 1:

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

Example 2:

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

Example 3:

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

&nbsp;
Constraints:

<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>

numberOfCombinations

Number of Ways to Separate Numbers

Decode Ways

decode-ways

解码方法

Decode Ways II

decode-ways-ii

解码方法 II

Restore The Array

restore-the-array

恢复数组

Number of Beautiful Partitions

number-of-beautiful-partitions

完美分割的方案数

String

Dynamic Programming

Suffix Array

你写下了若干 正整数&nbsp;，并将它们连接成了一个字符串&nbsp;<code>num</code>&nbsp;。但是你忘记给这些数字之间加逗号了。你只记得这一列数字是 非递减&nbsp;的且&nbsp;没有 任何数字有前导 0 。

请你返回有多少种可能的 正整数数组&nbsp;可以得到字符串&nbsp;<code>num</code>&nbsp;。由于答案可能很大，将结果对 <code>109 + 7</code>&nbsp;取余&nbsp;后返回。

&nbsp;

示例 1：

<pre>输入：num = "327"
输出：2
解释：以下为可能的方案：
3, 27
327
</pre>

示例 2：

<pre>输入：num = "094"
输出：0
解释：不能有数字有前导 0 ，且所有数字均为正数。
</pre>

示例 3：

<pre>输入：num = "0"
输出：0
解释：不能有数字有前导 0 ，且所有数字均为正数。
</pre>

示例 4：

<pre>输入：num = "9999999999999"
输出：101
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= num.length &lt;= 3500</code></li>
	<li><code>num</code>&nbsp;只含有数字&nbsp;<code>'0'</code> 到&nbsp;<code>'9'</code>&nbsp;。</li>
</ul>