Leetcode/AddTwoNumbers.cpp at master · Jessicahust/Leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
#include<iostream>
#include<new>
using namespace std;

//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)
    {
        ListNode *p=l1;
        ListNode *pre=l1;
        ListNode *q=l2;
        int carry=0;
        while(p&&q)
        {
            if(p->val+q->val+carry>9)
            {
                p->val=(p->val+q->val+carry)%10;
                carry=1;
            }
            else
            {
                 p->val+=q->val+carry;
                 carry=0;
            }
            pre=p;
            p=p->next;
            q=q->next;
        }
        if(q)
            pre->next=q;
        while(q)
        {
            if(q->val+carry>9)
            {
                q->val=(q->val+carry)%10;
                carry=1;
            }
            else
            {
                q->val+=carry;
                carry=0;
                break;
            }
            pre=q;
            q=q->next;
        }
        while(p)
        {
            if(p->val+carry>9)
            {
                p->val=(p->val+carry)%10;
                carry=1;
            }
            else
            {
                p->val+=carry;
                carry=0;
                break;
            }
            pre=p;
            p=p->next;
        }
        if(carry)
        {
            p=new ListNode(1);
            pre->next=p;
        }
        return l1;
    }
    void createList(ListNode *&head,int *arr)
    {
        ListNode *p=NULL;
        int i=0;
        for(i=0; i<5; i++)
        {
            if(head==NULL)
            {
                head=new ListNode(arr[i]);
                if(head==NULL)
                    return;
            }
            else
            {
                p=new ListNode(arr[i]);
                p->next=head;
                head=p;
            }
        }
    }
};

int main()
{
    Solution s;
    ListNode *L1=NULL;
    ListNode *L2=NULL;
    ListNode *L=NULL;
    int arr1[10]= {1,9,7,5,3};
    int arr2[10]= {0,8,6,4,2};
    s.createList(L1,arr1);
    s.createList(L2,arr2);
    L=s.addTwoNumbers(L1,L2);
    while(L)
    {
        cout<<L->val<<" ";
        L=L->next;
    }
}