-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathadd_two_numbers.java
More file actions
executable file
·83 lines (72 loc) · 2.23 KB
/
add_two_numbers.java
File metadata and controls
executable file
·83 lines (72 loc) · 2.23 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
80
81
82
83
//Definition for singly-linked list.
class ListNode {
int val;
ListNode next;
ListNode(int x) {
val = x;
}
}
public class add_two_numbers {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode l3 = new ListNode(1);
int sum[] = new int[2];
ListNode p = l1;
ListNode q = l2;
ListNode r = l3;
sum[0] = sum[1] = 0;
while (p != null || q != null) {
if (p != null && q != null) {
sum = addTwoNumber(p.val, q.val, sum[1]);
r.val = sum[0];
if(p.next!=null || q.next!=null){
ListNode a = new ListNode(0);
r.next = a;
r = r.next;
}
p = p.next;
q = q.next;
} else if (p != null && q == null) {
while (p != null) {
sum = addTwoNumber(p.val, 0, sum[1]);
r.val = sum[0];
if(p.next!=null){
ListNode a = new ListNode(0);
r.next = a;
r = r.next;
}
p = p.next;
}
} else if (q != null && p == null) {
while (q != null) {
sum = addTwoNumber(0, q.val, sum[1]);
r.val = sum[0];
if(q.next!=null){
ListNode a = new ListNode(0);
r.next = a;
r = r.next;
}
q = q.next;
}
}
}
if(sum[1]==1){
ListNode a = new ListNode(0);
r.next = a;
r = a;
r.val = sum[1];
}
return l3;
}
public int[] addTwoNumber(int x, int y, int carry) {
int z = x + y + carry;
carry = 0;
if (z > 9) {
carry = z / 10;
z = z % 10;
}
int[] r = new int[2];
r[0] = z;
r[1] = carry;
return r;
}
}