leetcode 腾讯精选50

最新推荐文章于 2022-01-13 15:55:08 发布

goodyang1

最新推荐文章于 2022-01-13 15:55:08 发布

阅读量185

点赞数 1

分类专栏： leetcode

本文链接：https://blog.csdn.net/goodyang1/article/details/90084341

版权

leetcode 专栏收录该内容

3 篇文章 0 订阅

订阅专栏

题目链接：
https://leetcode-cn.com/problems/add-two-numbers/
代码：

/**

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 *p1 = l1;
	ListNode *p2 = l2;
	ListNode *head = new ListNode(0) ;
	ListNode *phead = head;
	int num = 0;
    if(p1 ==NULL&& p2 == NULL)
        return head; 
    
	while(num!=0||p1!=NULL||p2!=NULL)
	{
		int num1,num2;
		num1 = num2  = 0;
		if(p1!=NULL)
		{
			num1 = p1->val;
		}
		if(p2!=NULL)
		{
			num2 = p2->val;
		}

		int result = num1 + num2 + num;
		int val = result%10;
		num = result/10;

		ListNode *r = new ListNode(0);
		r->next = NULL;
		r->val = val;
		phead->next= r;
		phead=phead->next;
        if(p1!=NULL)
        {
           p1=p1->next;    
        }
		
        if(p2!=NULL)
        {
          p2=p2->next;    
        }
		

	}
	phead =  head->next;
    delete head;
    return phead;

}

};