c++-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

這道題考察的是鏈表相加，最簡單的方法就是用新的鏈表來存入數據，因此關鍵點在于鏈表的新建：

利用new來開辟存儲空間，也就是堆：

/*** 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) {int temp;int flag=0;ListNode* p=l1;ListNode* q=l2;ListNode* res_head = new ListNode(-1);ListNode* res_tmp=res_head;while(p!=NULL || q!=NULL || flag){temp=(p?p->val:0)+(q?q->val:0)+flag;flag=0;if(temp>=10){temp-=10;flag=1;}ListNode* tmp = new ListNode(temp);res_tmp->next=tmp;res_tmp=res_tmp->next;if(p) p = p->next;if(q) q = q->next;}return res_head->next;}
};