leetcode-2-两数相加

2020-9-5

这道两数相加以链表为数据结构，核心考察点在于对于进位的处理，遍历链表即可。有一个取巧的方法是先生成节点让两个链表等长，这样可以避免后续对于链表不同时结束遍历的处理。这道题耗费了两天时间，我发现自己对于链表的掌握还是不够透彻，而且总会选择一些看似投机取巧实则弄巧成拙的方法。

https://leetcode-cn.com/problems/add-two-numbers/

/**
 * 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) {
        ListNode *p1 = l1, *p2 = l2;
        int len1 = 0, len2 = 0;
        while(p1->next)
        {
            p1 = p1->next;
            len1++;
        }
        while(p2->next)
        {
            p2 = p2->next;
            len2++;
        }
        if(len1 > len2)
        {
            for(int i=0;i<len1-len2;i++)
            {
               p2->next = new ListNode(0); 
               p2 = p2->next;
            }
        }
        else if(len2 > len1)
        {
            for(int i=0;i<len2-len1;i++)
            {
                p1->next = new ListNode(0);
                p1 = p1->next;
            }
        }
        int jinwei = 0;
        ListNode *head = new ListNode(-1);
        ListNode *r = head;
        p1 = l1;
        p2 = l2;
        while(p1 != NULL && p2 != NULL)
        {
            int temp = p1->val + p2->val + jinwei;
            jinwei = temp / 10;
            r->next = new ListNode(temp%10);
            r = r->next;
            p1 = p1->next;
            p2 = p2->next;
        }
        if(jinwei)
        {
            r->next = new ListNode(1);
            r = r->next;
        }
        return head->next;
        
    }
};