LeetCode之Relative Ranks
【摘要】 1、题目
Given scores of N athletes, find their relative ranks and the people with the top three highest scores, who will be awarded medals: "Gold Medal", "Silver Medal" and "Bron...
1、题目
Given scores of N athletes, find their relative ranks and the people with the top three highest scores, who will be awarded medals: "Gold Medal", "Silver Medal" and "Bronze Medal".
Example 1:
Input: [5, 4, 3, 2, 1]
Output: ["Gold Medal", "Silver Medal", "Bronze Medal", "4", "5"]
Explanation: The first three athletes got the top three highest scores, so they got "Gold Medal", "Silver Medal" and "Bronze Medal".
For the left two athletes, you just need to output their relative ranks according to their scores.
Note:
- N is a positive integer and won't exceed 10,000.
- All the scores of athletes are guaranteed to be unique.
Subscribe to see which companies asked this question.
2、代码实现
public class Solution {
public static String s0 = "Gold Medal";
public static String s1 = "Silver Medal";
public static String s2 = "Bronze Medal";
public String[] findRelativeRanks(int[] nums) {
if (nums == null || nums.length == 0)
return null;
int length = nums.length;
int[] nums1 = nums.clone();
//冒泡
for (int i = 1; i < length; ++i) {
for (int j = 0; j < length - i; ++j) {
if (nums1[j] <= nums1[j + 1]) {
int temp = nums1[j];
nums1[j] = nums1[j + 1];
nums1[j + 1] = temp;
}
}
}
String[] s = new String[length];
for (int i = 0; i < length; ++i) {
for (int j = 0; j < length; ++j) {
if (nums1[i] == nums[j]) {
if (i == 0)
s[j] = s0;
else if (i == 1)
s[j] = s1;
else if (i == 2)
s[j] = s2;
else
s[j] = String.valueOf(i + 1);
}
}
}
return s;
}
}
文章来源: chenyu.blog.csdn.net,作者:chen.yu,版权归原作者所有,如需转载,请联系作者。
原文链接:chenyu.blog.csdn.net/article/details/69941453
【版权声明】本文为华为云社区用户转载文章,如果您发现本社区中有涉嫌抄袭的内容,欢迎发送邮件进行举报,并提供相关证据,一经查实,本社区将立刻删除涉嫌侵权内容,举报邮箱:
cloudbbs@huaweicloud.com
- 点赞
- 收藏
- 关注作者
评论(0)