-
Notifications
You must be signed in to change notification settings - Fork 0
/
2. Add Two Numbers
38 lines (35 loc) · 994 Bytes
/
2. Add Two Numbers
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
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode result = new ListNode(0);
ListNode ptr = result;
int carry=0;
while(l1!=null || l2!=null){
int sum =carry;
if(l1!=null){
sum = sum +l1.val;
l1 = l1.next;
}
if(l2!=null){
sum = sum+l2.val;
l2 = l2.next;
}
carry =sum/10;
sum =sum%10;
ptr.next = new ListNode(sum);
ptr = ptr.next;
}
// if carry remain in last
if(carry==1) ptr.next = new ListNode(1);
return result.next;
}
}