資訊專(zhuān)欄INFORMATION COLUMN
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?
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.
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()));
}
}
文章版權(quán)歸作者所有，未經(jīng)允許請(qǐng)勿轉(zhuǎn)載,若此文章存在違規(guī)行為，您可以聯(lián)系管理員刪除。
轉(zhuǎn)載請(qǐng)注明本文地址：http://systransis.cn/yun/66232.html
摘要：為了減少無(wú)效遍歷，我們可以在尋找第一個(gè)數(shù)字和第二個(gè)數(shù)字的時(shí)候及時(shí)終止。我們可以知道第一個(gè)數(shù)字的長(zhǎng)度不應(yīng)該超過(guò)字符串長(zhǎng)度的一般，第二個(gè)數(shù)字的長(zhǎng)度無(wú)法超過(guò)字符串長(zhǎng)度減去第一個(gè)數(shù)字的長(zhǎng)度。因此一旦遇到，在判斷完作為加數(shù)時(shí)是否合法后，直接跳出循環(huán)。 題目要求 Additive number is a string whose digits can form additive sequence....
摘要：描述累加數(shù)是一個(gè)字符串，組成它的數(shù)字可以形成累加序列。一個(gè)有效的累加序列必須至少包含個(gè)數(shù)。說(shuō)明累加序列里的數(shù)不會(huì)以開(kāi)頭，所以不會(huì)出現(xiàn)或者的情況。示例輸入輸出解釋累加序列為。 LeetCode 306. Additive Number Description Additive number is a string whose digits can form additive sequen...
摘要：題目解答不越界長(zhǎng)度的當(dāng)可以走到后面沒(méi)有和了的時(shí)候，說(shuō)明這個(gè)滿(mǎn)足條件直接可以知道這個(gè)是不是存在于中越界長(zhǎng)度的越界長(zhǎng)的度 題目：Additive number is a string whose digits can form additive sequence. A valid additive sequence should contain at least three numbers...
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...
閱讀 2839·2021-11-24 09:39
閱讀 4138·2021-10-27 14:19
閱讀 2056·2021-08-12 13:25
閱讀 2346·2019-08-29 17:07
閱讀 1122·2019-08-29 13:44
閱讀 1074·2019-08-26 12:17
閱讀 470·2019-08-23 17:16
閱讀 2058·2019-08-23 16:46
