-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAdd_Two_Numbers.java
More file actions
142 lines (124 loc) · 3.66 KB
/
Add_Two_Numbers.java
File metadata and controls
142 lines (124 loc) · 3.66 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
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
2. Add Two Numbers
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
You may assume the two numbers do not contain any leading zero, except the number 0 itself.
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
//mine
public class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
if(l1==null) {
return l2;
}
if(l2==null) {
return l1;
}
ListNode dummy = new ListNode(-1);
ListNode prev = dummy;
int adv = 0;
while(l1!=null || l2!=null) {
int sum = adv;
if(l1!=null) {
sum+=l1.val;
l1=l1.next;
}
if(l2!=null) {
sum+=l2.val;
l2=l2.next;
}
adv = sum/10;
prev.next = new ListNode(sum%10);
prev = prev.next;
}
if(adv>0) {
prev.next = new ListNode(adv);
}
return dummy.next;
}
}
//////////////////////////////////////////////////////////////////////////////
public class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
if(l1==null) return l2;
if(l2==null) return l1;
int adv = 0;
ListNode head = null;
ListNode tail = null;
while(l1!=null && l2!=null) {
int sum = adv + l1.val + l2.val;
int value = sum%10;
adv = sum>=10 ? 1 : 0;
if(head==null) {
head = new ListNode(value);
tail = head;
} else {
tail.next = new ListNode(value);
tail = tail.next;
}
l1 = l1.next;
l2 = l2.next;
}
ListNode p = null;
if(l1!=null) {
p = l1;
} else if(l2!=null) {
p = l2;
}
while(p!=null) {
int sum = adv + p.val;
int value = sum % 10;
adv = sum>=10 ? 1 : 0;
tail.next = new ListNode(value);
tail = tail.next;
p = p.next;
}
if(adv>0)
tail.next = new ListNode(adv);
return head;
}
}
//////////////////////////////////////////////////////////////////////////////
public class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
if (l1 == null) return l2;
if (l2 == null) return l1;
ListNode head = new ListNode(0);
ListNode cur = head;
int plus = 0;
while (l1 != null && l2 != null) {
int sum = l1.val + l2.val + plus;
plus = sum / 10;
sum = sum % 10;
cur.next = new ListNode(sum);
cur = cur.next;
l1 = l1.next;
l2 = l2.next;
}
if (l1 != null) {
if (plus != 0) {
cur.next = addTwoNumbers(l1, new ListNode(plus));
} else {
cur.next = l1;
}
} else if (l2 != null) {
if (plus != 0) {
cur.next = addTwoNumbers(l2, new ListNode(plus));
} else {
cur.next = l2;
}
} else if (plus != 0) {
cur.next = new ListNode(plus);
}
return head.next;
}
}