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
译文:给定两个非空的链表,表示两个非负整数。数字以相反的顺序存储,每个节点包含一个数字。求和两个数字并将其作为链表返回。
您可以假设两个数字不包含任何前导零,除了数字0本身。
The best answer i thought from DISCUSS:
/**
* 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 prehead(0), *p = &prehead; //构造函数必须带参数
int extra = 0;
while(l1||l2||extra){
int sum = (l1?l1->val:0) + (l2?l2->val:0) + extra; //注意括号的位置(l1?l1->val:0)整个扩起来而不是问号后面
p->next = new ListNode(sum % 10);
p = p->next;//这一步别忘了!!!(链表太久没写了233)
extra = sum/10;
l1 = l1?l1->next:l1;//假设l1长度比l2短很多,若l1已经是NULL,则其没有next!!!
l2 = l2?l2->next:l2;
}
return prehead.next;
}
};
一个链表总结 点击打开链接