-
Notifications
You must be signed in to change notification settings - Fork 1
/
Solution.java
executable file
·44 lines (39 loc) · 1.17 KB
/
Solution.java
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
package $002;
import datastruc.ListNode;
/**
* @author Junlan Shuai[shuaijunlan@gmail.com].
* @date Created on 16:27 2017/5/2.
*/
public class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
int sum = 0;
ListNode head = new ListNode(0);
ListNode temp_head = head;
while (l1 != null || l2 != null) {
if (l1 != null) {
sum += l1.val;
l1 = l1.next;
}
if (l2 != null) {
sum += l2.val;
l2 = l2.next;
}
temp_head.val = sum % 10;
temp_head.next = new ListNode(sum / 10);
if (l1 == null && l2 == null && temp_head.next.val == 0) {
temp_head.next = null;
return head;
}
temp_head = temp_head.next;
sum /= 10;
}
return head;
}
public static void main(String[] args) {
ListNode listNode = new ListNode(1);
ListNode listNode1 = new ListNode(9);
listNode1.next = new ListNode(9);
Solution solution = new Solution();
solution.addTwoNumbers(listNode, listNode1);
}
}