FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
leetcode/src/addTwoNumbers/addTwoNumbers.cpp at master · AndyleeSharp/leetcode · GitHub
AndyleeSharp
/
leetcode
Public
forked from
haoel/leetcode
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Wiki
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
leetcode
/
src
/
addTwoNumbers
/
addTwoNumbers.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
65 lines (56 loc) · 1.64 KB
Breadcrumbs
leetcode
/
src
/
addTwoNumbers
/
addTwoNumbers.cpp
Copy path
File metadata and controls
65 lines (56 loc) · 1.64 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
//
Source : https://oj.leetcode.com/problems/add-two-numbers/
//
Author : Hao Chen
//
Date : 2014-06-18
/*
*********************************************************************************
*
* You are given two linked lists representing two non-negative numbers.
* 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.
*
* Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
* Output: 7 -> 0 -> 8
*
*********************************************************************************
*/
/*
*
* 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
x=
0
, y=
0
, z=
0
;
ListNode *h=
NULL
, *t=
NULL
;
while
(l1!=
NULL
|| l2!=
NULL
){
x =
getValueAndMoveNext
(&l1);
y =
getValueAndMoveNext
(&l2);
z = z + x + y;
ListNode *node =
new
ListNode
(z%
10
);
if
(h ==
NULL
){
h = t = node;
}
else
{
t->
next
= node;
t = node;
}
z = z/
10
;
}
while
(z >
0
) {
ListNode *node =
new
ListNode
(z%
10
);
t->
next
= node;
z = z/
10
;
}
return
h;
}
private:
int
getValueAndMoveNext
(ListNode** l){
int
x =
0
;
if
( (*l) !=
NULL
){
x = (*l)->
val
;
(*l) = (*l)->
next
;
}
return
x;
}
};
Back
|
FazBrowse Home
|
New Git URL