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
/**
* 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) {
ListNode rs=null;
ListNode r1=rs;
ListNode p1=l1;
ListNode p2=l2;
int pre=0;
int data=0;
if(l1==null){
return l2;
}
if(l2==null){
return l1;
}
while(p1!=null&&p2!=null){
int tmp=p1.val+p2.val+pre;
data=tmp%10;
pre=tmp/10;
if(rs==null){
r1=rs=new ListNode(data);
}else{
ListNode n=new ListNode(data);
r1.next=n;
r1=n;
}
p1=p1.next;
p2=p2.next;
}
while(p1!=null){
int tmp=p1.val+pre;
data=tmp%10;
pre=tmp/10;
ListNode n=new ListNode(data);
r1.next=n;
r1=n;
p1=p1.next;
}
while(p2!=null){
int tmp=p2.val+pre;
data=tmp%10;
pre=tmp/10;
ListNode n=new ListNode(data);
r1.next=n;
r1=n;
p2=p2.next;
}
if(pre>0){
ListNode n=new ListNode(pre);
r1.next=n;
}
return rs;
}
}