力扣-两数相加

给你两个 非空 的链表，表示两个非负的整数。它们每位数字都是按照 逆序 的方式存储的，并且每个节点只能存储 一位 数字。请你将两个数相加，并以相同形式返回一个表示和的链表。你可以假设除了数字 0 之外，这两个数都不会以 0 开头。

头文件：

using namespace std;
struct ListNode {
	int val;
	ListNode *next;
	ListNode() : val(0), next(nullptr) {}
	ListNode(int x) : val(x), next(nullptr) {}
	ListNode(int x, ListNode *next) : val(x), next(next) {}
};
class Solution2 {
public:
	Solution2();
	~Solution2() {}
	ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
		ListNode *head = nullptr, *tail = nullptr;
		int carry = 0;
		while (l1 || l2) {
			int n1 = l1 ? l1->val : 0;//判断l1是否为空，不为空则取n1=val，为空则取n1=0
			int n2 = l2 ? l2->val : 0;
			int sum = n1 + n2 + carry;
			if (!head) {
				head = tail = new ListNode(sum % 10);
			}
			else {
				tail->next = new ListNode(sum % 10);
				tail = tail->next;
			}
			carry = sum / 10;
			if (l1) {
				l1 = l1->next;
			}
			if (l2) {
				l2 = l2->next;
			}
		}
		if (carry > 0) {
			tail->next = new ListNode(carry);
		}
		return head;
	}
};

源文件：
 

#include <iostream>
using namespace std;
#include"2.h"
Solution2::Solution2()
{
	ListNode  *head1 = nullptr, *head2 = nullptr, *tail1 = nullptr, *tail2 = nullptr;
	int flag;
	cout << "是否查看预置效果？是输入1,否则输入其他";
	cin >> flag;
	int n1, n2,val1,val2;
	if (flag == 1)
	{
		n1 = 3;
	}
	else
	{
		cout << "请输入链表1的长度：" << endl;
		cin >> n1;
	}
	for (int i = 0; i < n1; i++)
	{
		if (flag == 1)
		{
			if (i == 0)
			{
				val1 = 2;
				cout << val1 << "\t";
			}
			else if (i == 1)
			{
				val1 = 4;
				cout << val1 << "\t";
			}
			else if (i == 2)
			{
				val1 = 3;
				cout << val1 << endl;
			}
			else
			{
				val1 = 0;
			}
		}
		else
		{
			cout << "请输入链表1的第" << i << "个值：" << endl;
			cin >> val1;
		}
		if (i == 0)
		{
			head1=tail1 = new ListNode(val1);
		}
		else 
		{
			tail1->next = new ListNode(val1);
			tail1 = tail1->next;
		}
	}
	if (flag == 1)
	{
		n2 = 3;
	}
	else
	{
		cout << "请输入链表2的长度：" << endl;
		cin >> n2;
	}
	for (int i = 0; i < n2; i++)
	{
		if (flag == 1)
		{
			if (i == 0)
			{
				val2 = 5;
				cout << val2 << "\t";
			}
			else if (i == 1)
			{
				val2 = 6;
				cout << val2 << "\t";
			}
			else if (i == 2)
			{
				val2 = 4;
				cout << val2 << endl;
			}
			else
			{
				val2 = 0;
			}
		}
		else {
			cout << "请输入链表2的第" << i << "个值：" << endl;
			cin >> val2;
		}
		if (i == 0)
		{
			head2 = tail2 = new ListNode(val2);
		}
		else
		{
			tail2->next = new ListNode(val2);
			tail2 = tail2->next;
		}
	}
	ListNode *result = addTwoNumbers(head1, head2);
	cout << "结果是:" << endl;
	while (result)
	{	
		cout<<result->val << "\t";
		result = result->next;
	}
	cout << endl;
}

main.cpp:

using namespace std;
#include"2.h"
void main()
{
	Solution2 jxq = Solution2();
}

输出结果：