-
Notifications
You must be signed in to change notification settings - Fork 0
/
2
55 lines (43 loc) · 1.41 KB
/
2
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
import java.math.BigDecimal;
class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
BigDecimal TEN = new BigDecimal(10);
BigDecimal sum = new BigDecimal(0);
int i = 0;
while (l1 != null && l2 != null) {
sum = TEN.pow(i).multiply(new BigDecimal(l1.val + l2.val)).add(sum);
//sum += (l1.val + l2.val) * Math.pow(10, i);
l1 = l1.next;
l2 = l2.next;
i++;
}
while (l1 != null) {
//sum += l1.val * Math.pow(10, i);
sum = sum.add(TEN.pow(i).multiply(new BigDecimal(l1.val)));
l1 = l1.next;
i++;
}
while (l2 != null) {
sum = sum.add(TEN.pow(i).multiply(new BigDecimal(l2.val)));
// sum += l2.val * Math.pow(10, i);
l2 = l2.next;
i++;
}
ListNode head, pointer;
head = new ListNode();
pointer = head;
//put result to a new list
while (true) {
pointer.val = sum.remainder(TEN).intValue();
//pointer.val = (int) (sum % 10);
//sum = (long) (sum / 10); // remove fractions.
sum = sum.divide(TEN);
if (sum.compareTo(new BigDecimal(1)) < 0) {
break;
}
pointer.next = new ListNode();
pointer = pointer.next;
}
return head;
}
}