forked from hongtaocai/code_interview
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathaddtwonumbers.java
More file actions
executable file
·55 lines (51 loc) · 1.48 KB
/
addtwonumbers.java
File metadata and controls
executable file
·55 lines (51 loc) · 1.48 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
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
// Start typing your Java solution below
// DO NOT write main() function
if(l1==null) return l2;
if(l2==null) return l1;
ListNode ans = new ListNode(0);
ListNode res = ans;
int add = 0;
while(true){
if(l1==null && l2==null){
if(add!=0){
ans.next = new ListNode(1);
ans = ans.next;
}
break;
}
else if(l1!=null && l2==null){
ans.next = new ListNode((add+l1.val)%10);
add = (add+l1.val)/10;
ans = ans.next;
l1 = l1.next;
}
else if(l1==null && l2!=null){
ans.next = new ListNode((add+l2.val)%10);
add = (add+l2.val)/10;
ans = ans.next;
l2 = l2.next;
}
else{
ans.next = new ListNode((add+l1.val+l2.val)%10);
add = (add+l1.val+l2.val)/10;
ans = ans.next;
l1 = l1.next;
l2 = l2.next;
}
}
return res.next;
}
}