2.cpp

#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<bitset>
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) {
        ListNode *h = new ListNode(0);	//Í·½Úµã
		ListNode *p = h;
		int temp = 0;
		while(l1!=NULL&&l2!=NULL)
		{
			p->next = new ListNode((temp+l1->val+l2->val)%10);	//±¾Î»
			temp=(temp+l1->val+l2->val)/10;	//½øλ
			p=p->next;
			l1=l1->next;
			l2=l2->next;
		}
		while(l1!=NULL)
		{
			p->next = new ListNode ((temp+l1->val)%10);
			temp = (temp+l1->val)/10;
			p=p->next;
			l1=l1->next;
		}
		while(l2!=NULL)
		{
			p->next = new ListNode ((temp+l2->val)%10);
			temp=(temp+l2->val)/10;
			p=p->next;
			l2=l2->next;
		}
		if(temp)
		{
			p->next = new ListNode(temp);
		}
		return h->next;
    }
};