-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathAdd to Array-Form of Integer
93 lines (70 loc) · 2.07 KB
/
Add to Array-Form of Integer
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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
class Solution {
public List<Integer> addToArrayForm(int[] A, int K) {
List<Integer> a = new ArrayList<Integer>();
String sum = "";
String min = "";
int forward = 0;
String max = "";
int result = 0;
int first;
int second;
if(A.length>(K+"").length()){
max = toString(A);
min = "" + K;
}
else{
min = toString(A);
max = "" + K;
}
for(int i = 0; i<min.length(); i++){
first = min.charAt(min.length()-1-i) - '0';
second = max.charAt(max.length()-1-i) - '0';
result = first + second + forward;
if(result < 10){
sum += "" + result;
forward = 0;
}
else{
sum += "" + (result-10);
forward = 1;
}
}
if(max.length()==min.length()){
if(forward == 1){
sum += "1";
}
a = addTo(sum);
return a;
}
for(int z = max.length()-min.length()-1; z>=0; z--){
result = (max.charAt(z)-'0') + forward;
if(result < 10){
sum += "" + result;
forward = 0;
}
else{
sum += "" + (result - 10);
forward = 1;
}
}
if(forward == 1){
sum += "1";
}
a = addTo(sum);
return a;
}
public static String toString(int[] a){
String b ="";
for(int i = 0; i<a.length; i++){
b+="" + a[i];
}
return b;
}
public static List<Integer> addTo(String a){
List<Integer> b = new ArrayList<Integer>();
for(int i = 0; i<a.length(); i++){
b.add(Integer.parseInt(a.charAt(a.length()-i-1)+""));
}
return b;
}
}