-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathadditive-sequence.java
56 lines (56 loc) · 1.61 KB
/
additive-sequence.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
class Solution {
static String findSum(String a,String b){
int i=a.length()-1,j=b.length()-1;
StringBuilder ans = new StringBuilder();
int carry=0;
while(i>=0 && j>=0){
int sum = (a.charAt(i)-'0')+(b.charAt(j)-'0')+carry;
ans.append((char)sum%10);
carry=sum/10;
i--;
j--;
}
while(i>=0){
int sum = (a.charAt(i)-'0')+carry;
ans.append((char)sum%10);
carry=sum/10;
i--;
}
while(j>=0){
int sum = (b.charAt(j)-'0')+carry;
ans.append((char)sum%10);
carry=sum/10;
j--;
}
if(carry!=0){
ans.append((char)(carry+'0'));
}
StringBuilder temp = ans.reverse();
return temp.toString();
}
static boolean help(String a,String b,String c){
String sum = findSum(a,b);
int i=0,j=0;
while(i<c.length() && j<sum.length()){
if(c.charAt(i)!=sum.charAt(j))return false;
i++;
j++;
}
if(j!=sum.length())return false;
if(i==c.length())return true;
c=c.substring(i);
return help(b,sum,c);
}
public boolean isAdditiveSequence(String n) {
// code here
for(int i=0;i<n.length()/2;i++){
for(int j=i+1;j<n.length()-1;j++){
String a = n.substring(0,i+1);
String b = n.substring(i+1,j+1);
String c = n.substring(j+1);
if(help(a,b,c))return true;
}
}
return false;
}
}