成人国产在线小视频_日韩寡妇人妻调教在线播放_色成人www永久在线观看_2018国产精品久久_亚洲欧美高清在线30p_亚洲少妇综合一区_黄色在线播放国产_亚洲另类技巧小说校园_国产主播xx日韩_a级毛片在线免费

資訊專欄INFORMATION COLUMN

306. Additive Number

dkzwm / 2145人閱讀

摘要：題目解答不越界長度的當(dāng)可以走到后面沒有和了的時(shí)候，說明這個(gè)滿足條件直接可以知道這個(gè)是不是存在于中越界長度的越界長的度

題目：
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?

解答：
不越界長度的Recursive:

public boolean isValid(Long x1, Long x2, String num, int start) {
    //當(dāng)可以走到后面沒有和了的時(shí)候，說明這個(gè)string滿足條件
    if (start == num.length()) return true;
    x2 = x1 + x2;
    x1 = x2 - x1;
    String sum = x2.toString();
    //string.startsWith()直接可以知道這個(gè)sum是不是存在于num中
    return num.startsWith(sum, start) && isValid(x1, x2, num, start + sum.length());
}

public boolean isAdditiveNumber(String num) {
    int len = num.length();
    for (int i = 1; i <= len / 2; i++) {
        if (num.charAt(0) == "0" && i > 1) return false;
        Long x1 = Long.parseLong(num.substring(0, i));
        for (int j = 1; Math.max(i, j) <= len - i - j; j++) {
            if (num.charAt(i) == "0" && j > 1) break;
            Long x2 = Long.parseLong(num.substring(i, i + j));
            if (isValid(x1, x2, num, i + j)) return true;
        }
    }
    return false;
}

越界長度的recursive:

public boolean isValid(BigInteger x1, BigInteger x2, String num, int start) {
    if (start == num.length()) return true;
    x2 = x2.add(x1);
    x1 = x2.subtract(x1);
    String sum = x2.toString();
    return num.startsWith(sum, start) && isValid(x1, x2, num, start + sum.length());
}

public boolean isAdditiveNumber(String num) {
    int len = num.length();
    for (int i = 1; i <= len / 2; i++) {
        if (num.charAt(0) == "0" && i > 1) return false;
        BigInteger x1 = new BigInteger(num.substring(0, i));
        for (int j = 1; Math.max(i, j) <= len - i - j; j++) {
            if (num.charAt(i) == "0" && j > 1) break;
            BigInteger x2 = new BigInteger(num.substring(i, i + j));
            if (isValid(x1, x2, num, i + j)) return true;
        }
    }
    return false;
}

越界長的度iterator: (tail recursion is easy to transfer)

public boolean isValid(int i, int j, String num) {
    if (num.charAt(0) == "0" && i > 1) return false;
    if (num.charAt(i) == "0" && j > 1) return false;
    BigInteger x1 = new BigInteger(num.substring(0, i));
    BigInteger x2 = new BigInteger(num.substring(i, i + j));
    String sum;
    for (int start = i + j; start < num.length(); start += sum.length()) {
        x2 = x2.add(x1);
        x1 = x2.subtract(x1);
        sum = x2.toString();
        if (!num.startsWith(sum, start)) return false;
    }
    return true;
}

public boolean isAdditiveNumber(String num) {
    int len = num.length();
    for (int i = 1; i <= len / 2; i++) {
        for (int j = 1; Math.max(i, j) <= len - i - j; j++) {
            if (isValid(i, j, num)) {
                return true;
            }
        }
    }
    return false;
}

文章版權(quán)歸作者所有，未經(jīng)允許請(qǐng)勿轉(zhuǎn)載,若此文章存在違規(guī)行為，您可以聯(lián)系管理員刪除。

轉(zhuǎn)載請(qǐng)注明本文地址：http://systransis.cn/yun/64979.html

相關(guān)文章

  • leetcode306. Additive Number

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

    2shou 評(píng)論0 收藏0

  • LeetCode 306. Additive Number

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

    GeekQiaQia 評(píng)論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 評(píng)論0 收藏0

  • [LeetCode] Additive Number

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

    yibinnn 評(píng)論0 收藏0

發(fā)表評(píng)論

0條評(píng)論

最新活動(dòng)
閱讀需要支付1元查看
<