LeetCode2. Add Two Numbers(链表加法)

题目链接：https://leetcode.com/problems/add-two-numbers/

You are given two linked lists representing two non-negative numbers. 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.

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) {}
};

链表创建（C++版本）

 ListNode *ans = new ListNode(0);
 ListNode *h = ans;
 h->next = new ListNode(1);   //尾插
 h = h->next;

链表创建（C版本）

 ListNode *ans = (ListNode*)malloc(sizeof(ListNode));ans->next = NULL;   //建立带头结点的空链表

参考代码：

/**
 * 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 *ans = new ListNode(0);
        ListNode *p,*q,*h = ans;
        int add = 0;
        for(p=l1,q=l2;p||q;p=p?p->next:p,q=q?q->next:q){
          int x = (p?p->val:0) + (q?q->val:0);
          h->next = new ListNode ((x + add) % 10);  
          h = h->next;                                //尾插
          add = (x+add >= 10?1:0);
       }
      if(add){
         h->next = new ListNode(add);
         h = h->next;
      }
      return ans->next;
    }
};