Add Two Numbers

最新推荐文章于 2021-02-19 08:37:33 发布

Thomas_YiSaYa

最新推荐文章于 2021-02-19 08:37:33 发布

阅读量320

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/q286989429/article/details/47012741

版权

LeetCode 专栏收录该内容

37 篇文章 0 订阅

订阅专栏

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
 int LengthList(struct ListNode* head);
 struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2)
{
	int lengLong=LengthList(l1);
	int lengshort=LengthList(l2);
	struct ListNode* pCurrent;
	int tmp;
	if(lengLong<lengshort)
	{
		pCurrent=l1;
		l1=l2;
		l2=pCurrent;
		tmp=lengLong;
        lengLong=lengshort;
		lengshort=tmp;
	}
	struct ListNode* SumNumberHead=(struct ListNode*)malloc(sizeof(struct ListNode)); 
	int carry=0; //存储进位
	int i=0;
	int j=0;
	pCurrent=SumNumberHead;  //存储和的头
	struct ListNode* pCurrent1=l1;
	struct ListNode* pCurrent2=l2;
	struct ListNode* pCurrentForTail;
	for(;j<lengshort;i++,j++)
	{
		//每一位相加
		pCurrent->val=pCurrent1->val+pCurrent2->val+carry;
		if(pCurrent->val/10>0)
		{
		    	carry=pCurrent->val/10;
			pCurrent->val=pCurrent->val%10;
		
		}
		else
			carry=0; //没有进位..

		pCurrent1=pCurrent1->next;
		pCurrent2=pCurrent2->next;
		struct ListNode* NewNode=(struct ListNode*)malloc(sizeof(struct ListNode)); 
		pCurrent->next=NewNode; //让他有节点.
		pCurrentForTail=pCurrent;
		pCurrent=pCurrent->next;
	}
	//i,j可以只用一个
	for(;i<lengLong;i++)
	{
		pCurrent->val=pCurrent1->val+carry;
		if(pCurrent->val/10>0)
		{
		    	carry=pCurrent->val/10;
			pCurrent->val=pCurrent->val%10;
		
		}
		else
			carry=0; //没有进位..

		pCurrent1=pCurrent1->next;
		struct ListNode* NewNode=(struct ListNode*)malloc(sizeof(struct ListNode)); 
		pCurrent->next=NewNode; //让他有节点.
		pCurrentForTail=pCurrent;
		pCurrent=pCurrent->next;
	}
	if(carry>0)
	{
		pCurrent->val=carry;
        pCurrentForTail=pCurrent;
		pCurrent=pCurrent->next;
	}
	pCurrentForTail->next=NULL;//记录一个pCurrent之前的节点

	return SumNumberHead;
}

int LengthList(struct ListNode* head) 
{
	if(head==NULL)
		return 0;

	int length=0;
	struct ListNode* pCurrent=head;
	while(pCurrent!=NULL)
	{
		length++;
		pCurrent=pCurrent->next;
	}
	//free(pCurrent);
	return length;
}