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的基础知识,以下是我的源码
public class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
if(l1==null) return l2;
if(l2==null) return l1;
ListNode result = l1; //用来返回结果
ListNode last = new ListNode(0);//记录当l2和l1等长时的最后一个node
int jin = 0;
/*注意while循环里其实只是改变了每一个node的val值,并没有改变指向关系,这一点很重要,刚开始很可能弄不懂为什么result只被赋值了 一次却可以返回正确结果,其实result=l1之后,result就指向了原来l1指向的node,所以不管以后l1指向哪里,与result都无关,只是改 变l1的val值才会影响到result*/
while(l1 != null && l2 != null){
l1.val = l1.val + l2.val + jin;
jin = l1.val/10;
l1.val = l1.val%10;
last = l1;
l1 = l1.next;
l2 = l2.next;
}
//若l2比l1长则将l2接到reslt后边
if(l2!=null) {
last.next = l2;
while(l2!=null && jin != 0){
l2.val = l2.val + jin;
jin = l2.val/10;
l2.val = l2.val%10;
last = l2;
l2 = l2.next;
}
}
if(l1!=null){
while(l1 != null && jin != 0){
l1.val = l1.val + jin;
jin = l1.val/10;
l1.val = l1.val%10;
last = l1;
l1 = l1.next;
}
}
//若加完之后还有进位则新建一个node接在最后
if(jin != 0){
last.next = new ListNode(1);
}
return result;
}
}