-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path506_relativerank.cpp
106 lines (93 loc) · 2.36 KB
/
506_relativerank.cpp
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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
class Solution {
public:
vector<string> findRelativeRanks(vector<int>& score) {
int n = score.size();
vector<string>result(n);
unordered_map<int,int>m;
for(int i=0;i<n;i++){
m[score[i]] =i ;
}
sort(score.begin(),score.end(),greater<int>());
for(int i=0;i<n;i++){
if(i==0){
int a = m[score[i]];
result[a] ="Gold Medal";
}
else if(i==1){
int a = m[score[i]];
result[a] = "Silver Medal";
}
else if(i==2){
int a = m[score[i]];
result[a] = "Bronze Medal";
}
else{
int a = m[score[i]];
result[a] = to_string(i+1);
}
}
return result;
}
};
class Solution {
public:
vector<string> findRelativeRanks(vector<int>& score) {
int n = score.size();
vector<string>r(n);
priority_queue<pair<int,int>>p;
for(int i=0;i<n;i++){
p.push({score[i],i});
}
int rank=1;
while(!p.empty()){
int ind = p.top().second;
p.pop();
if(rank==1){
r[ind]="Gold Medal";
}
else if(rank==2){
r[ind]="Silver Medal";
}
else if(rank==3){
r[ind]="Bronze Medal";
}
else{
r[ind] = to_string(rank);
}
rank++;
}
return r;
}
};
class Solution {
public:
vector<string> findRelativeRanks(vector<int>& score) {
int n = score.size();
vector<string>r(n);
int me = *max_element(score.begin(),score.end());
vector<int> m(me+1,-1);
for(int i =0;i<n;i++){
m[score[i]] = i;
}
int rank=1;
for(int k=me;k>=0;k--){
if(m[k] != -1){
int a = m[k];
if(rank ==1){
r[a] = "Gold Medal";
}
else if(rank ==2){
r[a] = "Silver Medal";
}
else if(rank ==3){
r[a] = "Bronze Medal";
}
else {
r[a] = to_string(rank);
}
rank++;
}
}
return r;
}
};