Add Two Numbers(Medium):Selected from Leetcode No.2 Question-CSDN博客

本文链接：https://blog.csdn.net/weixin_43699371/article/details/104543326

Add Two Numbers(Medium):Selected from Leetcode No.2 Question

Description: Given two non-empty link lists representing integers.The digit are sorted in reserve order and each of their nodes contain a single digit.Add numbers and return it as a linked list.

Input	(2->4->3)+(5->6->4)
Output	(7->0->8)
Exlpanation	342+456=807

//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){
		int count1=0,count2=0;//用做记录两个链表中节点的个数
		int i;
		ListNode* p;//返回链表的辅助指针
		vector<int> v,v_l1,v_l2;//v用作存储两个链表相加后的每一位的存储工具，v_l1用作存储第一个链表对应位置的值，v_l2用作存储第二个链表对应位置的值
		//取到第一个链表各个位置的值，存入v_l1中
		for(ListNode* p1=l1;p1!=NULL;p1=p1->next){
			v_l1.push_back（p1->val）;
			count1++;
		}
		//取到第二个链表各个位置的值，存入v_l2中
		for(ListNode* p2=l2;p2!=NULL;p2=p2->next){
			v_l2.push_back(p2->val);
			count2++;
		}
		//用0补齐链表较短的，将count1作为计数器
		if(count1>count2){
			for(i=0;i<count1-count2;i++){
				v_l2.push_back(0);
			}
		}
		else if(count1<count2){
			for(i=0;i<count2-count1;i++){
				v_l1.push_back(0);
			}
			count1=count2;
		}
		//计算求和过程
		for(i=0;i<count1;i++){
			if(v_l1[i]+v_l2[i]>=10){
				//此时判断是否到达计数器的最值，如果到达，则需要有进位过程，并将容器增加一位
				if(i+1==count1){
					v_l1.push_back(1);//将容器v_l1扩大一位，赋值为1
					v_l2.push_back(0);
					v_l1[i]=(v_l1[i]+v_l2[i])-10;
					v_l2[i]=0;
					count1++;
				}
				//不是最后一位加和超过10时
				else{
					v_l1[i+1]=1;
					v_l1[i]=(v_l1[i]+v_l2[i])-10;
					v_l2[i]=0;
				}
			}
			//不存在加和超过10的情况，则直接相加存入容器v
			v.push_back(v_l1[i]+v_l2[i]);
		}
		//建立链表，然后存入对应的值
		ListNode* node=new ListNode(v[0]);
		p=node;
		for(i=0;i<count1;i++){
			ListNode* new_node=new ListNode(v[i]);
			p->next=new_node;
			p=p->next;
		}
		return node;
	}
}