FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
LeetCode-Solutions/Python/design-twitter.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
/
design-twitter.py
Copy path
More file actions
More file actions
Latest commit
History
History
History
73 lines (61 loc) · 2.44 KB
Breadcrumbs
LeetCode-Solutions
/
Python
/
design-twitter.py
Copy path
File metadata and controls
73 lines (61 loc) · 2.44 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
# Time: O(klogu), k is most recently number of tweets,
# u is the number of the user's following.
# Space: O(t + f), t is the total number of tweets,
# f is the total number of followings.
import
collections
import
heapq
class
Twitter
(
object
):
def
__init__
(
self
):
"""
Initialize your data structure here.
"""
self
.
__number_of_most_recent_tweets
=
10
self
.
__followings
=
collections
.
defaultdict
(
set
)
self
.
__messages
=
collections
.
defaultdict
(
list
)
self
.
__time
=
0
def
postTweet
(
self
,
userId
,
tweetId
):
"""
Compose a new tweet.
:type userId: int
:type tweetId: int
:rtype: void
"""
self
.
__time
+=
1
self
.
__messages
[
userId
].
append
((
self
.
__time
,
tweetId
))
def
getNewsFeed
(
self
,
userId
):
"""
Retrieve the 10 most recent tweet ids in the user's news feed. Each item in the news feed must be posted by users who the user followed or by the user herself. Tweets must be ordered from most recent to least recent.
:type userId: int
:rtype: List[int]
"""
max_heap
=
[]
if
self
.
__messages
[
userId
]:
heapq
.
heappush
(
max_heap
, (
-
self
.
__messages
[
userId
][
-
1
][
0
],
userId
,
0
))
for
uid
in
self
.
__followings
[
userId
]:
if
self
.
__messages
[
uid
]:
heapq
.
heappush
(
max_heap
, (
-
self
.
__messages
[
uid
][
-
1
][
0
],
uid
,
0
))
result
=
[]
while
max_heap
and
len
(
result
)
<
self
.
__number_of_most_recent_tweets
:
t
,
uid
,
curr
=
heapq
.
heappop
(
max_heap
)
nxt
=
curr
+
1
if
nxt
!=
len
(
self
.
__messages
[
uid
]):
heapq
.
heappush
(
max_heap
, (
-
self
.
__messages
[
uid
][
-
(
nxt
+
1
)][
0
],
uid
,
nxt
))
result
.
append
(
self
.
__messages
[
uid
][
-
(
curr
+
1
)][
1
])
return
result
def
follow
(
self
,
followerId
,
followeeId
):
"""
Follower follows a followee. If the operation is invalid, it should be a no-op.
:type followerId: int
:type followeeId: int
:rtype: void
"""
if
followerId
!=
followeeId
:
self
.
__followings
[
followerId
].
add
(
followeeId
)
def
unfollow
(
self
,
followerId
,
followeeId
):
"""
Follower unfollows a followee. If the operation is invalid, it should be a no-op.
:type followerId: int
:type followeeId: int
:rtype: void
"""
self
.
__followings
[
followerId
].
discard
(
followeeId
)
Back
|
FazBrowse Home
|
New Git URL