forked from yuanx/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAddTwoNumbers.java
More file actions
76 lines (64 loc) · 1.73 KB
/
AddTwoNumbers.java
File metadata and controls
76 lines (64 loc) · 1.73 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
/**
* 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
return addNumbers(l1,l2,0);
}
public ListNode addNumbers(ListNode l1, ListNode l2, int carry){
ListNode r;
int temp,c;
if(l1==null && l2==null){
if(carry == 0)
return null;
else{
r = new ListNode(1);
return r;
}
}
if(l1== null){
temp = l2.val + carry;
if(temp>9){
temp -= 10;
c = 1;
}
else
c = 0;
r = new ListNode(temp);
r.next = addNumbers(null,l2.next,c);
}
else if(l2 == null){
temp = l1.val + carry;
if(temp>9){
temp -= 10;
c = 1;
}
else
c = 0;
r = new ListNode(temp);
r.next = addNumbers(l1.next,null,c);
}
else{
temp = l1.val + l2.val + carry;
if(temp>9){
temp -= 10;
c = 1;
}
else
c = 0;
r = new ListNode(temp);
r.next = addNumbers(l1.next, l2.next, c);
}
return r;
}
}