LeetCode:Add Two Numbers

最新推荐文章于 2019-02-21 19:00:24 发布

原创最新推荐文章于 2019-02-21 19:00:24 发布 · 330 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

12 篇文章

订阅专栏

本文介绍了一种算法，该算法将两个表示为逆序链表形式的非负整数进行相加，并返回结果作为新的链表。通过遍历链表节点并逐位计算进位来完成这一过程。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
       if(l1==NULL||l2==NULL){
		
			return l1==NULL?l2:l1;
		}
		ListNode *plist01=l1,*plist02=l2,*pre=l1,*pPre=NULL;
		ListNode *head=l1;
		int data=0;
		int carry=0;
		while (plist01&&plist02)
		{
			data=carry+plist01->val+plist02->val;
			carry=data/10;
			data=data%10;
			plist01->val=data;
			pre=plist01->next;
			if(carry!=0&&plist01->next==NULL&&plist02->next==NULL){
			
				plist01->next=new ListNode(carry);
			}
			pPre=plist01;
			plist01=pre;
			plist02=plist02->next;
		}
		while (plist01)
		{
			data=carry+plist01->val;
			carry=data/10;
			data=data%10;
			plist01->val=data;
			pre=plist01->next;
			if(carry!=0&&plist01->next==NULL){
			
				plist01->next=new ListNode(carry);
			}
			plist01=pre;
		}
		if(plist02){
		
			pPre->next=plist02;
		}
		while (plist02)
		{
			data=carry+plist02->val;
			carry=data/10;
			data=data%10;
			plist02->val=data;
			pre=plist02->next;
			if(carry!=0&&plist02->next==NULL){
			
				plist02->next=new ListNode(carry);
			}
			plist02=pre;
		}
		
		return head;
    }