1 /**
 2  * Definition for singly-linked list.
 3  * struct ListNode {
 4  *     int val;
 5  *     ListNode *next;
 6  *     ListNode(int x) : val(x), next(NULL) {}
 7  * };
 8  */
 9 class Solution {
10 public:
11     ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
 
12         int flag = 0;//進位
13         ListNode* tail = new ListNode(0);
14         ListNode* ptr = tail;
15  
16         while(l1 != NULL || l2 != NULL)
17         {
18             int val1 = 0;
19             if(l1 != NULL)
20             {
21                 val1 = l1->val;
22                 l1 = l1->next;
 
23             }
24  
25             int val2 = 0;
26             if(l2 != NULL)
27             {
28                 val2 = l2->val;
29                 l2 = l2->next;
30             }
31  
32             int tmp = val1 + val2 + flag;
33             ptr->next = new ListNode(tmp % 10);
34             flag = tmp / 10;
35             ptr = ptr->next;
36         }
37         //處理結束了flag還有一個進位則新申請一個為1的結點連入鏈表
38         if(flag == 1)
39         {
40             ptr->next = new ListNode(1);
41         }
42         return tail->next;
43     }
44 };

leetcode鏈表--14、add-two-numbers（兩鏈表相加 得到新鏈表）