leetcode 2. Add Two Numbers
Description
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
此题的关键在于考虑两个列表长度不相同的,还不断产生进位,比如l1=[8,9,9,9,9,9] l2=[2,1]
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
void deeltail(struct ListNode * pre,struct ListNode * r,int carry);
struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2) {
struct ListNode * head ,*p,*q,*pre;
int carry = 0;
if(l1 == NULL) return l2;
if(l2 == NULL) return l1;
head = l1;
p = head;
while(l1 && l2){
pre = p;//指向p指针的前向指针
p->val = l1->val + l2->val + carry;
carry = 0;
if(p->val > 9){
p->val -= 10;
carry = 1;
}
l1 = l1->next;
l2 = l2->next;
p = p->next;
}
if(!l1 && !l2){//l1与l2都只有一个数
if(carry){
q= (struct ListNode *)malloc(sizeof(struct ListNode));
q->val = carry;
q->next = NULL;
pre->next = q;
}
}
else if(l2){//l1的长度小于l2,由于head最初是指向l1的,特殊处理
deeltail(pre,l2,carry);
}
else{//l1的长度大于l2
deeltail(pre,l1,carry);
}
return head;
}
void deeltail(struct ListNode * pre,struct ListNode * r,int carry){
struct ListNode * q;
pre->next = r;
q = pre->next;
while(q){
q->val +=carry;
if(q->val>9){
q->val -= 10;
carry = 1;
}else{
carry =0;
}
pre = q;
q = q->next;
}
if(carry){//最后一个节点加上进位大于10需处理多出来的节点,val=1
q= (struct ListNode *)malloc(sizeof(struct ListNode));
q->val = carry;
q->next = NULL;
pre->next = q;
}
}