[C++]练习使用链表逆序存储的两个数相加

#include "stdafx.h"
#include <cstdlib>
#include <iostream>
using std::cout;
using std::endl;

typedef struct tagSNode {
    int value;
    tagSNode * pNext;
    tagSNode(int v):value(v),pNext(NULL){}
}SNode;

SNode * Add(SNode* pHead1, SNode* pHead2) {
    SNode* pSum = new SNode(0);
    SNode* pTail = pSum;
    SNode* p1 = pHead1->pNext;
    SNode* p2 = pHead2->pNext;
    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);
        pTail->pNext = pCur;//新节点链接到pTail后
        pTail = pCur;
        //指针后移
        p1 = p1->pNext;
        p2 = p2->pNext;
    }
    //处理较长的指针
    SNode* p = p1 ? p1 : p2;
    while (p) {
        value = p->value + carry;
        carry = value / 10;
        value = value % 10;
        pCur = new SNode(p->value);
        pTail->pNext = pCur;
        pTail = pCur;
        p = p->pNext;
    }
    //处理可能存在的进位
    if (carry != 0) {
        pCur = new SNode(carry);
        pTail->pNext = pCur;
    }
    return pSum;
}

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

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

int main()
{
    SNode * pHead1 = new SNode(0);
    int i;
    for (i = 0; i < 6; i++) {
        SNode* p = new SNode(rand() % 10);
        //头插法创建新的链表pHead1
        p->pNext = pHead1->pNext;
        pHead1->pNext = p;
    }
    SNode* pHead2 = new SNode(0);
    for (i = 0; i < 9; i++) {
        SNode* p = new SNode(rand() % 10);
        //头插法创建新链表pHead2
        p->pNext = pHead2->pNext;
        pHead2->pNext = 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;
}