LeetCode/AddTwoNumbers.cpp at master · imyouxia/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
#include <iostream>

using namespace std;

struct ListNode
{
	int val;
	ListNode *next;
	ListNode(int x):val(x),next(NULL)
	{

	}
};

class Solution
{
public:
	ListNode *addTwoNumbers(ListNode *l1,ListNode *l2)
	{
		if(l1 == NULL && l2 == NULL)
			return NULL;

		ListNode *head = NULL;
		ListNode *pre = head;
		int flag = 0;

		while(l1 && l2)
		{
			ListNode *node = new ListNode(l1->val + l2->val + flag);
			flag = node->val / 10;
			node->val = node->val % 10;

			if(head == NULL)
				head = node;
			else
				pre->next = node;

			pre = node;

			l1 = l1->next;
			l2 = l2->next;
		}

		while(l1)
		{
			ListNode *node = new ListNode(l1->val + flag);
			flag = node->val / 10;
			node->val = node->val % 10;

			if(head == NULL)
				head = node;
			else
				pre->next = node;
			pre = node;
			l1 = l1->next;
		}

		while(l2)
		{
			ListNode *node = new ListNode(l2->val + flag);
			flag = node->val / 10;
			node->val = node->val % 10;

			if(head == NULL)
				head = node;
			else
				pre->next = node;

			pre = node;
			l2 = l2->next;

		}

		if(flag > 0)
		{
			ListNode *node = new ListNode(flag);
			pre->next = node;
		}

		return head;
	}
};

int main()
{
	Solution solution;
	ListNode *l1 = new ListNode(2);
	l1->next = new ListNode(4);
	l1->next->next = new ListNode(3);

	ListNode *l2 = new ListNode(5);
	l2->next = new ListNode(6);
	l2->next->next = new ListNode(4);

	ListNode *value = solution.addTwoNumbers(l1,l2);
	while(value != NULL)
	{
		cout << value->val << " ";
		value = value->next;
	}
	cout<<endl;
	return 0;

}