题目:
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
详细的双向链表的讲解可参考:http://blog.csdn.net/lovoo/article/details/51771321
这个结题方法是参考别人的,比较简单易懂
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2){
if(l1 == null) return l2;
if(l2 == null) return l1;
int flag = 0;
ListNode pre = new ListNode(0);
ListNode res = l1;
pre.next = l1;
while(l1 != null && l2 != null){
l1.val = l1.val + l2.val + flag;
flag = l1.val / 10;
l1.val = l1.val % 10;
pre = l1;
l1 = l1.next;
l2 = l2.next;
}
if (l2 != null){
pre.next = l2;
l1 = l2;
}
while(l1 != null){
l1.val += flag;
flag = l1.val / 10;
l1.val = l1.val % 10;
pre = l1;
l1 = l1.next;
}
if(flag > 0){
ListNode node = new ListNode(1);
pre.next = node;
}
return res;
}
}