leetcode编程记录10 #2 Add Two Numbers

leetcode编程记录10 #2 Add Two Numbers

标签（空格分隔）： leetcode

---

这是一道利用链表来完成相应的加法的一道题，主要是要求我们熟练掌握链表的相关知识，题目如下：

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

题目理解与分析：
这道题目的主要是处理链表，要注意处理三个关键点，一是其中一个或两个链表为空的情况，二是两个链表长度不相同的情况，三是链表相加之后有进位的情况。

代码如下：

/**
 * 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;
        ListNode* result =  new ListNode(0);
        ListNode* r = result;
        ListNode* last;
        int next_bit = 0;
        for (;p1 != NULL && p2 != NULL ; p1 = p1->next, p2 = p2->next)
        {
            int temp = r->val + p1->val + p2->val;
            r->val = temp % 10;
            next_bit = temp / 10;
            r->next = new ListNode(next_bit);
            last = r;
            r = r->next;
        }
        if (p1 == NULL && p2 == NULL)
        {
            if (next_bit == 0)
            {
                last->next = NULL;
            }
            return result;
        } else if (p1 == NULL && p2 != NULL) {
            p1 = p2;
        }
        for (; p1 != NULL; p1 = p1 ->next)
        {
            int temp = r->val + p1->val;
            r->val = temp % 10;
            next_bit = temp / 10;
            r->next = new ListNode(next_bit);
            last = r;
            r = r->next;
        }
        if (next_bit == 0)
            {
                last->next = NULL;
            }
        return result;
    }
};