-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path002add2num.java
72 lines (72 loc) · 1.62 KB
/
002add2num.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
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
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
if(l1==null) return l2;
if(l2==null) return l1;
ListNode result,p_a,p_b,p_r;
if(getLength(l1)>getLength(l2))
result=l1;
else
result=l2;
int inc=0;
int sum=0;
p_a = l1;
p_b = l2;
p_r = result;
while(p_a!=null&&p_b!=null)
{
sum = p_a.val + p_b.val + inc;
p_r.val = sum%10;
inc = (sum>9) ? 1:0;
p_r = p_r.next;
p_a = p_a.next;
p_b = p_b.next;
}
while(p_a!=null)
{
sum = p_a.val + inc;
p_r.val = sum%10;
inc = (sum>9) ? 1:0;
p_a = p_a.next;
p_r = p_r.next;
}
while(p_b!=null)
{
sum = p_b.val + inc;
p_r.val = sum%10;
inc = (sum>9) ? 1:0;
p_b = p_b.next;
p_r = p_r.next;
}
if(inc == 1)
{
p_r = result;
while(p_r.next != null)
{
p_r = p_r.next;
}
p_r.next = new ListNode(1);
}
return result;
}
private int getLength(ListNode list)
{
int len = 0;
if(list == null)
return len;
ListNode p = list;
while(p!=null)
{
len++;
p = p.next;
}
return len;
}
}