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
两个链表,要考虑一个加完后为空,另一个不为空的情况;进位的情况;
public class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
if(l1 == null) return l2;
if(l2 == null) return l1;
ListNode p = l1;
int pre = 0;
ListNode q = l1;
while(l1 != null && l2 != null){
int sum = l1.val + l2.val + pre;
pre = sum / 10;
sum = sum % 10;
l1.val = sum;
q = l1;
l1 = l1.next;
l2 = l2.next;
}
if(l1 == null){
q.next = l2;
l1 = q.next;
}
while(l1 != null && pre != 0){
int sum = l1.val + pre;
pre = sum / 10;
sum = sum % 10;
l1.val = sum;
q = l1;
l1 = l1.next;
}
if(pre != 0){
ListNode r = new ListNode(pre);
q.next = r;
}
return p;
}
}