FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
algorithm/Week_03/id_102/leetcode_703_102.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_03
/
id_102
/
leetcode_703_102.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
32 lines (28 loc) · 701 Bytes
Breadcrumbs
algorithm
/
Week_03
/
id_102
/
leetcode_703_102.cpp
Copy path
File metadata and controls
32 lines (28 loc) · 701 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
27
28
29
30
31
32
class
KthLargest
{
public:
int
n;
priority_queue<
int
, vector<
int
>, greater<
int
>> q;
/*
建立最小堆
*/
KthLargest
(
int
k, vector<
int
>& nums) {
n = k;
for
(
auto
i:nums){
add
(i);
}
}
int
add
(
int
val) {
/*
存放最大的K个数
*/
if
(q.
size
() < n) {
q.
push
(val);
}
else
{
if
(q.
top
() < val) {
q.
push
(val);
q.
pop
();
}
}
return
q.
top
();
}
};
/*
*
* Your KthLargest object will be instantiated and called as such:
* KthLargest* obj = new KthLargest(k, nums);
* int param_1 = obj->add(val);
*/
Back
|
FazBrowse Home
|
New Git URL