标签：
题目：
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
代码：
1 public ListNode addTwoNumbers(ListNode l1, ListNode l2) 2 { 3 ListNode dummyhead = new ListNode(0); 4 ListNode p =l1, q=l2, curr=dummyhead; 5 int carry=0; 6 7 8 while(p!=null||q!=null) 9 { 10 int x = (p!=null)?p.val:0; 11 int y = (q!=null)?q.val:0; 12 int digit=x+y+carry; 13 carry = digit/10; 14 15 curr.next=new ListNode(digit%10); 16 curr=curr.next; 17 18 if(p!=null)p=p.next; 19 if(q!=null)q=q.next; 20 21 } 22 23 if(carry>0) 24 { 25 curr.next=new ListNode(carry); 26 } 27 28 return dummyhead.next; 29 30 }
标签：
原文地址：http://www.cnblogs.com/hygeia/p/4765747.html
