[leetcode刷题 C++] 2. 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.

  Example:

   Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
   Output: 7 -> 0 -> 8
   Explanation: 342 + 465 = 807.
  

• 思路

1. O(max(m, n)), 其中m和n为链表长度。计算每一位，然后将进位加到下一位。

   刚看到这道题想的是直接把每个值都算出来，但是计算出来并且相加后还需要分解成每一位，并且还需要建立链表。太麻烦了。
   然后想到加法进位也就是0或1，自己实现也很简单，而且因为是倒序保存的，所以在遍历的同时可以进行加法计算: sum = x + y; bit = sum % 10; carry = sum / 10;

   值得注意的是：进位的问题。
   考虑情况: l1=[9,9,9], l2=[1]。此时，一直到l1的最后一位，都会有进位。

   代码如下：

   /**
    * 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 head(0);
           ListNode *pl1 = l1, *pl2 = l2, *cur;
           int sum = 0, carry = 0, x, y;
           
           cur = &head;
           while( pl1 || pl2 ) {
               x = (pl1 != NULL) ? pl1->val : 0;
               y = (pl2 != NULL) ? pl2->val : 0;
               
               sum  = x + y + carry;
               carry = sum / 10;
               
               cur->next = new ListNode(sum % 10);
               cur = cur->next;
               
               if(pl1) pl1 = pl1->next;
               if(pl2) pl2 = pl2->next;
           }
           
           if(carry == 1) {
               cur->next = new ListNode(carry);
           }
           return head.next;
       }
   };