Leetcode-2. 两数相加

这应该是全网有关这道题最长的代码了吧（hh~）感觉最近学编译原理学的脑子里都是if-else，看到这题第一反应是模拟链表加法的整个过程，居然还AC了，amazing！！！

/**
 * 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* res = new ListNode(0);
        ListNode* r = res;
        int t = 0;  // t表示进位，一开始进位为0
        
        while (l1 != NULL && l2 != NULL)
        {
            int sum = l1->val + l2->val;
            if (t == 0 && sum >= 10)    // 无进位，当前位置的和大于10
            {
                t = 1;
                sum = sum - 10;
            }
            else if (t == 0 && sum < 10) t = 0;  // 无进位，当前位置的和小于10
            else if (t == 1 && sum + 1 >= 10)  // 有进位，当前位置的和+1大于10
            {
                t = 1;
                sum = sum + 1 - 10;
            }
            else if (t = 1 && sum + 1 < 10) 
            {
                t = 0; // 有进位，当前位置的和+1小于10
                sum = sum + 1;
            }

            ListNode* node = new ListNode(sum);
            r->next = node;
            r = node;
            l1 = l1->next;
            l2 = l2->next;
        }

        while (l1 != NULL)
        {
            if (t == 1) 
            {
                if (l1->val + 1 >= 10)
                {
                    t = 1;
                    l1->val = l1->val + 1 - 10;
                }
                else 
                {
                    t = 0;
                    l1->val = l1->val + 1;
                }
            }
            ListNode* node = new ListNode(l1->val);
            r->next = node;
            r = node;
            l1 = l1->next;
        }

        while (l2 != NULL)
        {
            if (t == 1) 
            {
                if (l2->val + 1 >= 10)
                {
                    t = 1;
                    l2->val = l2->val + 1 - 10;
                } 
                else 
                {
                    t = 0;
                    l2->val = l2->val + 1;
                }
            }
            ListNode* node = new ListNode(l2->val);
            r->next = node;
            r = node;
            l2 = l2->next;
        }

        if (t == 1)
        {
            ListNode* node = new ListNode(1);
            r->next = node;
            r = node;
        }

        return res->next;
    }
};

其实进位完全可以直接参与运算，而不用费那么多心思考虑进位给高位带来的影响，来一份简洁版的吧hh~

/**
 * 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 = NULL, *tail = NULL;
        int t = 0;

        while (l1 != NULL || l2 != NULL)
        {
            int n1 = l1 ? (l1->val) : 0;
            int n2 = l2 ? (l2->val) : 0;
            int sum = n1 + n2 + t;
            if (head == NULL) head = tail = new ListNode(sum % 10);
            else
            {
                tail->next = new ListNode(sum % 10);
                tail = tail->next;
            }

            if (l1 != NULL) l1 = l1->next;
            if (l2 != NULL) l2 = l2->next;

            t = sum / 10;
        }
        if (t == 1) tail->next = new ListNode(1);

        return head;
    }
};