leetcode-2 Add Two Numbers

这题没什么难的，需要注意下边界情况：例如两个链表最后一位相加之后产生了进位的情况

我的代码（not concise not elegant）

<span style="font-family:Microsoft YaHei;font-size:14px;">/**
 * 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 && l2 == NULL) return NULL;
        if(l1 == NULL) return l2;
        if(l2 == NULL) return l1;
        ListNode *head = (ListNode *)malloc(sizeof(ListNode));
        head->next = NULL;
        ListNode *curr = head;
        int carry = 0;
        while(l1 || l2){
            int sum = 0;
            if(l1 && l2){
                sum = l1->val + l2->val + carry;
                l1 = l1->next;
                l2 = l2->next;
            }else if(l1){
                sum = l1->val + carry;
                l1 = l1->next;
            }else{
                sum = l2->val + carry;
                l2 = l2->next;
            }
            ListNode *tmp = (ListNode *)malloc(sizeof(ListNode));
            tmp->val = sum % 10;
            carry = sum / 10;
            tmp->next = curr->next;
            curr->next = tmp;
            curr = tmp;
        }
        if(carry) {
            ListNode *tmp = (ListNode *)malloc(sizeof(ListNode));
            tmp->val = carry;
            tmp->next = curr->next;
            curr->next = tmp;
        }
        return head->next;
    }
};</span>

改进后的代码：

<span style="font-family:Microsoft YaHei;font-size:14px;">/**
 * 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 carry = 0;
        ListNode head(0),*p = &head; //注意：这里一定要有(0)，否则报错：<span style="color: rgb(169, 68, 66); line-height: 20px; background-color: rgb(242, 222, 222);">no matching function for call to ‘ListNode::ListNode()’</span>
        p->next = NULL;
        while(l1 || l2 || carry){
            int sum = (l1 ? l1->val : 0) + (l2 ? l2->val : 0) + carry;
            p->next = new ListNode(sum % 10);
            p = p->next;
            carry = sum / 10;
            
            l1 = l1 ? l1->next : l1;
            l2 = l2 ? l2->next : l2;
        }
        return head.next;
    }
};</span>