You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Java版
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
int extra_add = 0;
ListNode lastNode = null;
ListNode firstNode = null;
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
int sum = l1.val+l2.val+extra_add;
int num = sum%10;
extra_add = sum/10;
lastNode = new ListNode(num);
firstNode = lastNode;
l1 = l1.next;
l2 = l2.next;
while(l1!=null && l2!=null){
sum = l1.val+l2.val+extra_add;
num = sum%10;
extra_add = sum/10;
ListNode l3 = new ListNode(num);
lastNode.next = l3;
l1 = l1.next;
l2 = l2.next;
lastNode = l3;
}
while(l1!=null){
sum = l1.val+extra_add;
num = sum%10;
extra_add = sum/10;
ListNode l3 = new ListNode(num);
lastNode.next = l3;
l1 = l1.next;
lastNode = l3;
}
while(l2!=null){
sum = l2.val+extra_add;
num = sum%10;
extra_add = sum/10;
ListNode l3 = new ListNode(num);
lastNode.next = l3;
l2 = l2.next;
lastNode = l3;
}
if (extra_add!=0){
ListNode l3 = new ListNode(extra_add);
lastNode.next = l3;
}
return firstNode;
}
}