2. Add Two Numbers
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
// 处理好进位即可,尤其是最后一位为1时,不要忘记单独处理
/**
* 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) {
int jw = 0;
int sum = 0;
ListNode* head = new ListNode(0);
ListNode* pCur = head;
while(l1 || l2){
sum = (l1 ? l1->val : 0) + (l2 ? l2->val : 0) + jw;
jw = sum / 10;
pCur->next = new ListNode(sum % 10);
pCur = pCur->next;
l1 = (l1 ? l1->next : l1);
l2 = (l2 ? l2->next : l2);
}
if(jw)
pCur->next = new ListNode(1);
return head->next;
}
};