2.Add Two Numbers

最新推荐文章于 2024-09-07 18:44:11 发布

喜欢Sunshine

最新推荐文章于 2024-09-07 18:44:11 发布

阅读量147

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/chuquanchang1051/article/details/79061808

版权

LeetCode 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

题目2：
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.

Example

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.
代码如下：

#include<iostream>
#include<stdlib.h>

using namespace std;
 //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 * head, *p1, *p2, *p, *q;
		p1 = l1;
		p2 = l2;
		int sum, JingWei = 0;  // 保存每位之和  
		int a, b = 0;
		head = q = NULL;
		while (p1 != NULL || p2 != NULL)
		{
			if (p1 != NULL) a = p1->val;
			else  a = 0;

			if (p2 != NULL) b = p2->val;
			else  b = 0;

			sum = a + b + JingWei;
			if (sum >= 10)
			{
				sum -= 10;
				JingWei = 1;
			}
			else JingWei = 0;

			p = new ListNode(sum);
			if (head == NULL)
			{
				head = p;
			}
			else
			{
				q->next = p;
			}
			q = p;
			if (p1 != NULL)   p1 = p1->next;
			if (p2 != NULL)   p2 = p2->next;
		}
		//最后还有进位
		if (JingWei)
		{
			p = new ListNode(JingWei);
			q->next = p;
		}
		return head;

	}

};
int main()
{
	Solution s;
	ListNode * p1, *p2;
	p1 = new ListNode(2);
	p2 = new ListNode(5);
	ListNode * pp = new ListNode(4);
	p1->next = pp;
	ListNode * ppp = new ListNode(3);
	pp->next = ppp;


	ListNode *d = new ListNode(6);
	ListNode *dd = new ListNode(4);
	p2->next = d;
	d->next = dd;

	ListNode* haha = s.addTwoNumbers(p1, p2);
	while (haha->next != NULL)
	{
		cout << haha->val << endl;
		haha = haha->next;
	}
	cout << haha->val << endl;

	system("pause");
	return 0;
}

写这道题的时候菜到连进行调试链表初始化都不会，抓狂
学习这条路任重而道远，坚持写题，提高自己的编程能力，莫负韶华
2018.1.15/2018.10.29号重写依旧不会