FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
algorithm/Week_01/id_131/LeetCode_83_131.cpp at master · feixiangcode/algorithm · GitHub
feixiangcode
/
algorithm
Public
forked from
algorithm001/algorithm
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
algorithm
/
Week_01
/
id_131
/
LeetCode_83_131.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
26 lines (26 loc) · 563 Bytes
Breadcrumbs
algorithm
/
Week_01
/
id_131
/
LeetCode_83_131.cpp
Copy path
File metadata and controls
26 lines (26 loc) · 563 Bytes
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
/*
*
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class
Solution
{
public:
ListNode*
deleteDuplicates
(ListNode* head) {
ListNode* data = head;
while
(data !=
NULL
&& data->
next
!=
NULL
)
{
if
(data->
val
== data->
next
->
val
)
{
data->
next
= data->
next
->
next
;
}
else
{
data = data->
next
;
}
}
return
head;
}
};
Back
|
FazBrowse Home
|
New Git URL