LeetCode 2. 两数相加 题解+测试 C/C++

模拟加法:每一位相加就好了，不足的位数当做0再相加，记得最后判断进位是否大于0，需要加上。

#include <iostream>
#include <cstdio>

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 Solution {
public:
	ListNode *addTwoNumbers(ListNode *l1,ListNode *l2) {
		ListNode *ret = new ListNode(0);
		ListNode *cur = ret;
		ListNode *c1 = l1,*c2 = l2;
		int carry = 0,x;
		while(c1||c2) {
			int a = c1?c1->val:0;
			int b = c2?c2->val:0;
			x = a+b+carry;
			if(c1)c1 = c1->next;
			if(c2)c2 = c2->next;
			carry = x/10;
			x = x%10;
			cur->next = new ListNode(x);
			cur = cur->next;
		}
		if(carry!=0)cur->next = new ListNode(carry);
		return ret->next;
	}
};


ListNode *createList(int a[],int n) {
	ListNode *head = nullptr,*p = nullptr;
	for(int i = 0;i<n;i++) {
		if(head==nullptr) {
			head = p = new ListNode(a[i]);

		}
		else {
			p->next = new ListNode(a[i]);
			p = p->next;
		}
	}
	return head;
}

void printList(ListNode *h) {
	while(h!=nullptr) {
		printf("%d ",h->val);
		h = h->next;
	}
	printf("\n");
}




int main() {
	int a1[] = {2,4,3};
	int a2[] = {5,6,4};
	// int b1[] = {0};
	// int b2[] = {0};
	// int c1[] = {9,9,9,9,9,9,9};
	// int c2[] = {9,9,9,9};
	ListNode *l1 = createList(a1,3);
	ListNode *l2 = createList(a2,3);
	Solution sol;
	ListNode *res = sol.addTwoNumbers(l1,l2);
	printList(res);

	return 0;
}