You are given two non-empty linked lists representing two non-negative integers. 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.
You may assume the two numbers do not contain any leading zero, except the number 0 itself.
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
/** * 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) { if(l1 == NULL) return l2; else if(l2 == NULL) return l1; int firstVal = (l1->val + l2->val)%10; int next = (l1->val + l2->val)/10; ListNode* result = new ListNode(firstVal); ListNode* head = result; l1 = l1->next; l2 = l2->next; for(;;) { if(l1 == NULL && l2 == NULL && next == 0) return result; else if(l1 == NULL && l2 == NULL && next != 0) { head->next = new ListNode(next); return result; } else if(l1 != NULL && l2 != NULL) { int Val = (l1->val + l2->val + next)%10; next = (l1->val + l2->val + next)/10; head->next = new ListNode(Val); head = head->next; l1 = l1->next; l2 = l2->next; } else if(l1 == NULL) { int Val = (0 + l2->val + next)%10; next = (0 + l2->val + next)/10; head->next = new ListNode(Val); head = head->next; l2 = l2->next; } else if(l2 == NULL) { int Val = (0 + l1->val + next)%10; next = (0 + l1->val + next)/10; head->next = new ListNode(Val); head = head->next; l1 = l1->next; } } } };
各种情况注意到就好了