Package g1901_2000.s1977_number_of_ways_to_separate_numbers

Class Solution

java.lang.Object
g1901_2000.s1977_number_of_ways_to_separate_numbers.Solution
public class Solution extends java.lang.Object
1977 - Number of Ways to Separate Numbers.

Hard

You wrote down many positive integers in a string called num. 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 num. Since the answer may be large, return it modulo 109 + 7.

Example 1:

Input: num = “327”

Output: 2

Explanation: You could have written down the numbers: 3, 27 327

Example 2:

Input: num = “094”

Output: 0

Explanation: No numbers can have leading zeros and all numbers must be positive.

Example 3:

Input: num = “0”

Output: 0

Explanation: No numbers can have leading zeros and all numbers must be positive.

Constraints:

  • 1 <= num.length <= 3500
  • num consists of digits '0' through '9'.

  • Constructor Summary

    Constructors
    Constructor
    Description
    Solution()
     

  • Method Summary

    Modifier and Type
    Method
    Description
    int
    numberOfCombinations(java.lang.String num)
     

    Methods inherited from class java.lang.Object

    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • numberOfCombinations

      public int numberOfCombinations(java.lang.String num)