-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy path989. Add to Array-Form of Integer
50 lines (39 loc) · 1.08 KB
/
989. 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
/*
For a non-negative integer X,
the array-form of X is an array of its digits in left to right order.
For example, if X = 1231, then the array form is [1,2,3,1].
Given the array-form A of a non-negative integer X, return the array-form of the integer X+K.
Example 1:
Input: A = [1,2,0,0], K = 34
Output: [1,2,3,4]
Explanation: 1200 + 34 = 1234
Example 2:
Input: A = [2,7,4], K = 181
Output: [4,5,5]
Explanation: 274 + 181 = 455
Example 3:
Input: A = [2,1,5], K = 806
Output: [1,0,2,1]
Explanation: 215 + 806 = 1021
Example 4:
Input: A = [9,9,9,9,9,9,9,9,9,9], K = 1
Output: [1,0,0,0,0,0,0,0,0,0,0]
Explanation: 9999999999 + 1 = 10000000000
*/
class Solution {
public List<Integer> addToArrayForm(int[] A, int K) {
List<Integer> result = new ArrayList<>();
int digit;
int X = 0;
for (int i = 0; i < A.length; i++) {
digit = A[i];
X = X * 10 + digit;
}
X = X + K;
do {
result.add(0, X % 10);
X /= 10;
} while (X > 0);
return result;
}
}