FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
LeetCode-Solutions/Python/array-partition-i.py at master · pythonpeixun/LeetCode-Solutions · GitHub
pythonpeixun
/
LeetCode-Solutions
Public
forked from
kamyu104/LeetCode-Solutions
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
LeetCode-Solutions
/
Python
/
array-partition-i.py
Copy path
More file actions
More file actions
Latest commit
History
History
History
47 lines (40 loc) · 1.05 KB
Breadcrumbs
LeetCode-Solutions
/
Python
/
array-partition-i.py
Copy path
File metadata and controls
47 lines (40 loc) · 1.05 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
# Time: O(r), r is the range size of the integers
# Space: O(r)
class
Solution
(
object
):
def
arrayPairSum
(
self
,
nums
):
"""
:type nums: List[int]
:rtype: int
"""
LEFT
,
RIGHT
=
-
10000
,
10000
lookup
=
[
0
]
*
(
RIGHT
-
LEFT
+
1
)
for
num
in
nums
:
lookup
[
num
-
LEFT
]
+=
1
r
,
result
=
0
,
0
for
i
in
xrange
(
LEFT
,
RIGHT
+
1
):
result
+=
(
lookup
[
i
-
LEFT
]
+
1
-
r
)
/
2
*
i
r
=
(
lookup
[
i
-
LEFT
]
+
r
)
%
2
return
result
# Time: O(nlogn)
# Space: O(1)
class
Solution2
(
object
):
def
arrayPairSum
(
self
,
nums
):
"""
:type nums: List[int]
:rtype: int
"""
nums
.
sort
()
result
=
0
for
i
in
xrange
(
0
,
len
(
nums
),
2
):
result
+=
nums
[
i
]
return
result
# Time: O(nlogn)
# Space: O(n)
class
Solution3
(
object
):
def
arrayPairSum
(
self
,
nums
):
"""
:type nums: List[int]
:rtype: int
"""
nums
=
sorted
(
nums
)
return
sum
([
nums
[
i
]
for
i
in
range
(
0
,
len
(
nums
),
2
)])
Back
|
FazBrowse Home
|
New Git URL