题目内容
You are given two non-empty linked lists representing two non-negative integers. 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.
You may assume the two numbers do not contain any leading zero, except the number 0 itself.
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
主要考点
链表的处理,遍历
题解
public class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
int sum=0,append=0,left=0;
ListNode root=new ListNode(0);
ListNode result=root;
while(l1!=null||l2!=null)
{
int v1=l1!=null?l1.val:0;
int v2=l2!=null?l2.val:0;
sum=v1+v2+append;
append=sum/10;
left=sum%10;
ListNode curse=new ListNode(left);
//result2=result;
result.next=curse;
result=curse;
if(l1!=null){
l1=l1.next;
}
if(l2!=null){
l2=l2.next;
}
}
if (append>0){
ListNode curse= new ListNode(append);
result.next=curse;
}
//ListNode test=new ListNode(11);
return root.next;
}
}