Add two numbers

问题描述

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

问题分析

把两个存在链表里的数逐位相加，首先要循环一遍，考虑循环的终止条件，应为两个链表都遍历完，进一步考虑每位相加可能会有进位，所以当有进位是不能终止循环。

算法（C++）

struct ListNode {
   int val;
   ListNode *next;
   ListNode(int x) : val(x), next(NULL) {}
};

class Solution {
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        ListNode res(0);
        ListNode *p = &res;
        int carry = 0;
        int x, y;
        while(l1 || l2 || carry)
        {
            if (l1 == null)
                x = 0;
            else x = l1->val;
            if (l2 == null)
                y =0;
            else y = l2->val;
            int sum = x + y + carry;
            carry = sum / 10;
            p->next = new ListNode(sum % 10);
            p = p->next;
            l1 = l1 ? l1->next : l1;
            l2 = l2 ? l2->next : l2;
        }
        return res.next;
    }
};

总结

这个题目不是很难，我觉得主要考的是对于链表的操作吧，特别是用结构体实现的链表，要遍历链表就要考虑好循环的终止条件，很容易忽视进位的存在而使得循环条件出现问题，造成错误。