leetcode 2. 两数相加

leetcode 2. 两数相加

遍历原来的链表并且建立新的链表

也可以尝试使用原有的链表以节约空间

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        ListNode* head = new ListNode;  //新的链表
        ListNode* p = head;
        int x = 0;   //表示进位
        while(l1 != NULL || l2 != NULL){
            if(l1 != NULL)
                x += l1->val,l1 = l1->next;
            if(l2 != NULL)
                x += l2->val,l2 = l2->next;
            ListNode* q = new ListNode(x % 10);p->next = q,p = q;
            x /= 10;
        }
        if(x != 0){
            ListNode* q = new ListNode(x);
            p->next = q;
        }
        return head->next;
    }
};