2 Add Two Number C++、JAVA

2.You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

Example

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807

JAVA

package java;

public class ListNode {
	int val;
	ListNode next;
	ListNode(int x) { val = x; }
	
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
    	ListNode pre = new ListNode(0);
    	ListNode head = pre;
    	
    	int carry = 0;
    	while(l1!=null||l2!=null||carry!=0){
    		ListNode cur = new ListNode(0);
    		int sum = ((l1==null)?0:l1.val)+((l2==null)?0:l2.val)+carry;
    		cur.val = sum%10;
    		carry = sum/10;
    		
    		pre.next = cur;
    		pre = cur;
    		
    		l1 = (l1==null)?l1:l1.next;
    		l2 = (l2==null)?l2:l2.next;
    	}
    	
    	return head.next;
    }
    

}

 

 

 

C 两个链表相加

#include <cstdlib>
#include <iostream>
using std::cout;
using std::endl;

typedef struct Node {
int value;
Node * next;
//Node(int v):value(v),next(NULL){} //初始化
}SNode;

SNode * Add(SNode* pHead1, SNode* pHead2) {
//SNode* pSum = new SNode(0);
SNode * pSum=(SNode*)malloc(sizeof(SNode));
pSum->value=0;
pSum->next=NULL;

SNode* pTail = pSum;
SNode* p1 = pHead1->next;
SNode* p2 = pHead2->next;
SNode* pCur;
int carry = 0;//进位
int value;
while (p1 && p2) {
value = p1->value + p2->value + carry;
carry = value / 10;//进位
value = value % 10;//余数
//pCur = new SNode(value);

pCur=(SNode*)malloc(sizeof(SNode));
pCur->value=value;
pCur->next=NULL;

pTail->next = pCur;//新节点链接到pTail后
pTail = pCur;
//指针后移
p1 = p1->next;
p2 = p2->next;
}
//处理较长的指针
SNode* p = p1 ? p1 : p2;
while (p) {
value = p->value + carry;
carry = value / 10;
value = value % 10;
//pCur = new SNode(p->value);

pCur=(SNode*)malloc(sizeof(SNode));
pCur->next=NULL;
pCur->value=p->value;

pTail->next = pCur;
pTail = pCur;
p = p->next;
}

// p=pSum;
// pSum=pSum->next;
// free(p);
//处理可能存在的进位
if (carry != 0) {
//pCur = new SNode(carry);

pCur=(SNode*)malloc(sizeof(SNode));
pCur->value=carry;
pCur->next=NULL;

pTail->next = pCur;
}
return pSum;
}

void Print(SNode *head) {
SNode * p = head;
while (p) {
cout << p->value;
p = p->next;
if (p)
cout << "->";
}
cout << endl;
}

void Destroy(SNode*head) {
while (head)
{
SNode *p = head;
head = head->next;
delete p;
}
}

int main()
{
// SNode * pHead1 = new SNode(0);

SNode* pHead1=(SNode*)malloc(sizeof(SNode));
pHead1->value=0;
pHead1->next=NULL;

int a[3]={2,4,3};
int b[3]={5,6,4};
int i;
for (i = 0; i < 3; i++) {
// SNode* p = new SNode(rand() % 10);

SNode* p=(SNode*)malloc(sizeof(SNode));
//p->value=rand()%10;
p->value=a[i];
p->next=NULL;

//头插法创建新的链表pHead1
p->next = pHead1->next;
pHead1->next = p;
}
//SNode* pHead2 = new SNode(0);

SNode* pHead2=(SNode*)malloc(sizeof(SNode));
pHead2->value=0;
pHead2->next=NULL;

for (i = 0; i < 3; i++) {
// SNode* p = new SNode(rand() % 10);

SNode* p=(SNode*)malloc(sizeof(SNode));
// p->value=rand()%10;
p->value=b[i];
p->next=NULL;

//头插法创建新链表pHead2
p->next = pHead2->next;
pHead2->next = p;
}
cout << "pHead1:\t";
Print(pHead1);
cout << "pHead2:\t";
Print(pHead2);
SNode* pSum = Add(pHead1, pHead2);
cout << "pSum:\t";
Print(pSum);
Destroy(pHead1);
Destroy(pHead2);
Destroy(pSum);
system("pause");
return 0;
}

 

//submit solution C++

class Solution {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2)
{
ListNode* pSum=(ListNode*)malloc(sizeof(ListNode));
pSum->val=0;
pSum->next=NULL;

ListNode* p1=l1;
ListNode* p2=l2;
ListNode* pTail=pSum;
ListNode* pCur;
int carry=0;
int value=0;

while(p1&&p2)
{
value=p1->val+p2->val+carry;
carry=value/10;
value=value%10;

pCur=(ListNode*)malloc(sizeof(ListNode));
pCur->val=value;
pCur->next=NULL;

pTail->next=pCur;
pTail=pTail->next;
p1=p1->next;
p2=p2->next;

}

ListNode *p=p1?p1:p2;
while(p)
{
value=p->val+carry;
carry=value/10;
value=value%10;

pCur=(ListNode*)malloc(sizeof(ListNode));
pCur->val=value;
pCur->next=NULL;

pTail->next=pCur;
pTail=pTail->next;
p=p->next;
}
if(carry)
{
pCur=(ListNode*)malloc(sizeof(ListNode));
pCur->val=carry;
pCur->next=NULL;

pTail->next=pCur;
pTail=pTail->next;
}
p=pSum;
pSum=pSum->next;
free(p);

return pSum;

}

};