FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
algorithm/Week_01/id_151/LeetCode_83_151.java 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_151
/
LeetCode_83_151.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
49 lines (43 loc) · 1.06 KB
Breadcrumbs
algorithm
/
Week_01
/
id_151
/
LeetCode_83_151.java
Copy path
File metadata and controls
49 lines (43 loc) · 1.06 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
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class
Solution
{
public
ListNode
deleteDuplicates
(
ListNode
head
) {
ListNode
ref
=
head
;
while
(
ref
!=
null
&&
ref
.
next
!=
null
) {
if
(
ref
.
val
==
ref
.
next
.
val
) {
ref
.
next
=
ref
.
next
.
next
;
}
else
{
ref
=
ref
.
next
;
}
}
return
head
;
}
/**
* 自己的做法，略显丑陋
* @param head
* @return
*/
public
ListNode
deleteDuplicates
(
ListNode
head
) {
ListNode
dummyHead
=
new
ListNode
(-
99999
);
ListNode
cur
=
dummyHead
,
p
=
head
;
cur
.
next
=
head
;
while
(
p
!=
null
) {
while
(
p
!=
null
&&
cur
.
val
==
p
.
val
) {
p
=
p
.
next
;
}
if
(
p
==
null
) {
cur
.
next
=
null
;
}
else
{
cur
.
next
=
p
;
cur
=
cur
.
next
;
}
}
return
dummyHead
.
next
;
}
}
Back
|
FazBrowse Home
|
New Git URL