原题:
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
求两个数的和,看上去还是比较简单,不过需要注意的是,不能用int相加,因为可能会溢出,导致结果错误,因此只能一位一位的相加,主要思想:
1 用一个新的链表来保存和,并且开始扫描两个链表
2 每次判断两个链表是否扫描完,只要有一个没扫描完,就继续循环,那个扫描完的链表的对应的值为0(KEY!!!)
3 需要注意进位,而且最后一次相加进位后,两个链表都扫描完毕,如果carry不为0,是要把最后一个进位的数字加在链表里。。。
代码如下(204 ms):
class Solution {
public:
ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
// IMPORTANT: Please reset any member data you declared, as
// the same Solution instance will be reused for each test case.
ListNode*head =NULL;// = new ListNode( (l1->val+l2->val)%10 );
ListNode*tail;
int carry = 0;
while (l1!=NULL || l2!=NULL){
//只要有一个不为空就继续,若某个为空时,值为0
int num1 = l1!=NULL?l1->val:0 ;
int num2 = l2!=NULL?l2->val:0 ;
ListNode * node = new ListNode( (num1+num2+carry)%10 );
//进位保存在carry中
carry = (num1+num2+carry)/10;
if(head==NULL){
head = node;
tail = head;
}
else{
tail->next = node;
tail = tail->next;
}
//不为空,则next,若为空,继续NULL
l1 = (l1!=NULL)?l1->next:NULL;
l2 = (l2!=NULL)?l2->next:NULL;
}
//最后的进位不为0,则需要把这个进位值加在链表最后
if(carry!=0){
ListNode * node = new ListNode( carry );
tail->next = node;
}
return head;
}
};