[LeetCode] Additive Number

yibinnn 發布于2019-08-14 16:38 / 3198人閱讀

Additive Number

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:
"112358" is an additive number because the digits can form an additive sequence: 1, 1, 2, 3, 5, 8.

1 + 1 = 2, 1 + 2 = 3, 2 + 3 = 5, 3 + 5 = 8
"199100199" is also an additive number, the additive sequence is: 1, 99, 100, 199.
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.

Follow up:
How would you handle overflow for very large input integers?

Note

Here is my thought:
you get two consecutive substrings with two for loops, then call a recursive function to check whether the rest string starts with the sum of them.

Solution

public class Solution {
    public boolean isAdditiveNumber(String num) {
        int n = num.length();
        for (int i = 1; i <= (n-1)/2; i++) {
            if (num.charAt(0) == "0" && i > 1) break;
            for (int j = i+1; j-i <= n-j && i <= n-j; j++) {
                if (num.charAt(i) == "0" && j > i+1) break;
                long num1 = Long.parseLong(num.substring(0,i));
                long num2 = Long.parseLong(num.substring(i,j));
                String substr = num.substring(j);
                if (isValid(num1, num2, substr)) return true;
            }
        }
        return false;
    }
    public boolean isValid(long num1, long num2, String str) {
        if (str.equals("")) return true;
        long sum = num1+num2;
        String s = ((Long)sum).toString();
        if (!str.startsWith(s)) return false;
        return isValid(num2, sum, str.substring(s.length()));
    }
}

云服務器 GPU云服務器 Additive LeetCode LeetCode_String leetcode_35_SearchIn

文章版權歸作者所有，未經允許請勿轉載,若此文章存在違規行為，您可以聯系管理員刪除。

轉載請注明本文地址：http://specialneedsforspecialkids.com/yun/66232.html

leetcode306. Additive Number

摘要：為了減少無效遍歷，我們可以在尋找第一個數字和第二個數字的時候及時終止。我們可以知道第一個數字的長度不應該超過字符串長度的一般，第二個數字的長度無法超過字符串長度減去第一個數字的長度。因此一旦遇到，在判斷完作為加數時是否合法后，直接跳出循環。題目要求 Additive number is a string whose digits can form additive sequence....

2shou 2019-08-15 15:09 評論0 收藏0
LeetCode 306. Additive Number

摘要：描述累加數是一個字符串，組成它的數字可以形成累加序列。一個有效的累加序列必須至少包含個數。說明累加序列里的數不會以開頭，所以不會出現或者的情況。示例輸入輸出解釋累加序列為。 LeetCode 306. Additive Number Description Additive number is a string whose digits can form additive sequen...

GeekQiaQia 2019-07-31 10:03 評論0 收藏0
306. Additive Number

摘要：題目解答不越界長度的當可以走到后面沒有和了的時候，說明這個滿足條件直接可以知道這個是不是存在于中越界長度的越界長的度題目：Additive number is a string whose digits can form additive sequence. A valid additive sequence should contain at least three numbers...

dkzwm 2019-08-14 14:23 評論0 收藏0
306. Additive Number

For example: 112358 is an additive number because the digits can form an additive sequence: 1, 1, 2, 3, 5, 8. 1 + 1 = 2, 1 + 2 = 3, 2 + 3 = 5, 3 + 5 = 8 199100199 is also an additive number, the addi...

eccozhou 2019-08-16 10:36 評論0 收藏0