FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
leetcode/leetcode_876.cpp at master · zdevt/leetcode · GitHub
zdevt
/
leetcode
Public
Notifications
You must be signed in to change notification settings
Fork
0
Star
1
Code
Issues
0
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
leetcode
/
leetcode_876.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
79 lines (65 loc) · 1.31 KB
Breadcrumbs
leetcode
/
leetcode_876.cpp
Copy path
File metadata and controls
79 lines (65 loc) · 1.31 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
66
67
68
69
70
71
72
73
74
75
76
77
78
/*
* =========================================================================
*
* FileName: leetcode_876.cpp
*
* Description:
*
* Version: 1.0
* Created: 2018-11-20 14:48:49
* Last Modified: 2018-11-20 14:49:20
* Revision: none
* Compiler: gcc
*
* Author: zt ()
* Organization:
*
* =========================================================================
*/
#
include
<
stdio.h
>
#
include
<
stdlib.h
>
#
include
<
stdint.h
>
#
include
<
stddef.h
>
#
include
<
string.h
>
#
include
<
signal.h
>
#
include
<
errno.h
>
#
include
<
unistd.h
>
#
include
<
netinet/in.h
>
#
include
<
arpa/inet.h
>
#
include
<
sys/socket.h
>
#
include
<
iostream
>
#
include
<
memory
>
#
include
<
algorithm
>
#
include
<
vector
>
#
include
<
thread
>
#
include
<
mutex
>
#
include
<
map
>
#
include
<
list
>
#
include
<
string
>
#
include
<
functional
>
struct
ListNode
{
int
val;
ListNode* next;
ListNode
(
int
x ) : val ( x ), next (
NULL
) {}
};
ListNode*
middleNode
( ListNode* head )
{
ListNode* p =
NULL
;
int
len =
0
;
int
mid =
0
;
for
(
auto
i = head; i !=
NULL
; i = i->
next
, ++len );
if
( len %
2
)
mid = ( len +
1
) /
2
;
else
mid = ( len /
2
) +
1
;
int
i =
1
;
for
( p = head; i < mid; p = p->
next
, ++i );
return
p;
}
int
main
(
int
argc,
char
* argv[] )
{
(
void
) argc;
(
void
) argv;
return
0
;
}
Back
|
FazBrowse Home
|
New Git URL