标签：des style blog color ar sp div on log
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 ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) 2 { 3 ListNode *p = NULL, *q = NULL, *head = new ListNode(-1); 4 int carray = 0, sum = 0; 5 6 p = head; 7 while ((l1 != NULL) || (l2 != NULL)) 8 { 9 sum = carray + (l1 != NULL ? l1->val : 0) + (l2 != NULL ? l2->val : 0); 10 q = new ListNode(sum >= 10 ? (sum - 10) : sum); 11 carray = sum >= 10 ? 1 : 0; 12 p->next = q; 13 p = q; 14 15 if (l1 != NULL) 16 l1 = l1->next; 17 if (l2 != NULL) 18 l2 = l2->next; 19 } 20 if (carray == 1) 21 { 22 q = new ListNode(carray); 23 p->next = q; 24 p = q; 25 } 26 27 p = head->next; 28 delete head; 29 return p; 30 }
标签：des style blog color ar sp div on log
原文地址：http://www.cnblogs.com/ym65536/p/4082407.html
