Question
Additive number is a string whose digits can form additive sequence.
A valid additive sequence should contain at least three numbers. Except for the first two numbers, each subsequent number in the sequence must be the sum of the preceding two.
For example:
For example:"112358"
is an additive number because the digits can form an additive sequence: 1, 1, 2, 3, 5, 8
.
1 | 1 + 1 = 2, 1 + 2 = 3, 2 + 3 = 5, 3 + 5 = 8 |
1 | "199100199" |
is also an additive number, the additive sequence is:
1 | 1, 99, 100, 199 |
.
1 | 1 + 99 = 100, 99 + 100 = 199 |
Note: Numbers in the additive sequence cannot have leading zeros, so sequence 1, 2, 03
or 1, 02, 3
is invalid.
Given a string containing only digits '0'-'9'
, write a function to determine if it’s an additive number.
Solution
The idea is quiet basic.
Choose the first number A, it can be the leftmost 1 up to i digits. i<=(L-1)/2, because the third number should be at least as long as the first number.
Choose the second number B, it can be the leftmost 1 up to j digits excluding the first number. The limit for j is in 2 conditions:
if the length of second number( j - i ) is longer than the first number( i ), then the third number’s length( L - j ) should >= ( j - i ).
if the length of second number( j - i ) is shorter than or equals to the first number( i ), then the third number’s length( L - j ) should >= i .
- Recursively check if there is one solution.
1 | public class Solution { |