-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAdd Two Numbers.java
More file actions
79 lines (72 loc) · 2.43 KB
/
Add Two Numbers.java
File metadata and controls
79 lines (72 loc) · 2.43 KB
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
import java.math.BigInteger;
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
String first = "";
String second = "";
ListNode newPointer = new ListNode();
ListNode pointer = l1;
while (pointer != null) {
first += pointer.val;
pointer = pointer.next;
}
pointer = l2;
while (pointer != null) {
second += pointer.val;
pointer = pointer.next;
}
//////////////////////////////////////////////////////////////////////////
StringBuilder reversed1 = new StringBuilder(first);
reversed1.reverse();
StringBuilder reversed2 = new StringBuilder(second);
reversed2.reverse();
BigInteger num1 = new BigInteger(reversed1.toString());
BigInteger num2 = new BigInteger(reversed2.toString());
BigInteger sum = num1.add(num2);
String total = sum.toString();
StringBuilder reversedTotal = new StringBuilder(total);
reversedTotal.reverse();
String newTotal = reversedTotal.toString();
if (newTotal.length() > first.length() && newTotal.length() > second.length()) {
ListNode newNode;
int i = 1;
if (first.length() > second.length()) {
newPointer = l1;
pointer = l1;
} else {
newPointer = l2;
pointer = l2;
}
while (pointer != null) {
pointer.val = Character.getNumericValue(newTotal.charAt(i));
pointer = pointer.next;
i++;
}
newNode = new ListNode(Character.getNumericValue(newTotal.charAt(0)), newPointer);
return newNode;
}
if (first.length() > second.length()) {
newPointer = l1;
pointer = l1;
} else {
newPointer = l2;
pointer = l2;
}
int i = 0;
while (pointer != null) {
pointer.val = Character.getNumericValue(newTotal.charAt(i));
pointer = pointer.next;
i++;
}
return newPointer;
}
}