-
Problem Description:
-
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
C++ Solution:
-
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { public: ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) { ListNode Dummy(0); ListNode* p = &Dummy; int count_number = 0; while(l1 || l2) { int val = count_number + (l1 ? l1->val:0) + (l2 ? l2->val:0); count_number = val / 10; val = val % 10; p->next = new ListNode(val); p = p->next; if(l1) { l1 = l1->next; } if(l2) { l2 = l2->next; } } if(count_number != 0) { p->next = new ListNode(count_number); p = p->next; } return Dummy.next; } };
备注:答案多有借鉴,请多担待