Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 40c4c83

Browse files
Relative Ranks
1 parent e8b22a7 commit 40c4c83

File tree

1 file changed

+14
-11
lines changed

1 file changed

+14
-11
lines changed

‎src/leetcode2018/RelativeRanks.java

Lines changed: 14 additions & 11 deletions
Original file line numberDiff line numberDiff line change
@@ -13,24 +13,27 @@ public String[] findRelativeRanks(int[] nums) {
1313
for(int i=0; i<= n; i++){
1414
copy[i]= nums[i];
1515
}
16-
mergeSort(nums, 0, nums.length-1);
16+
17+
mergeSort(nums, 0, nums.length-1);
18+
1719
for(int i=0; i< nums.length; i++){
1820
if(i==0){
1921
map.put(nums[n-i], "Gold Medal");
20-
}
21-
else if(i==1){
22-
map.put(nums[n-i], "Silver Medal");
23-
}
24-
else if(i==2){
25-
map.put(nums[n-i], "Bronze Medal");
26-
}
27-
else{
28-
map.put(nums[n-i], (i+1)+"");
29-
}
22+
}
23+
else if(i==1){
24+
map.put(nums[n-i], "Silver Medal");
25+
}
26+
else if(i==2){
27+
map.put(nums[n-i], "Bronze Medal");
28+
}
29+
else{
30+
map.put(nums[n-i], (i+1)+"");
31+
}
3032
}
3133
for(int i=0; i< copy.length; i++){
3234
str[i] = map.get(copy[i]);
3335
}
36+
3437
return str;
3538
}
3639

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /