LeetCode之Relative Ranks
来源:互联网 发布:11 选5遗漏数据查询 编辑:程序博客网 时间:2024/04/28 19:39
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;elses[j] = String.valueOf(i + 1);}}}return s; }}
0 0
- LeetCode之Relative Ranks
- LeetCode之路:500. Relative Ranks
- LeetCode 506. Relative Ranks
- leetcode-506-Relative Ranks
- [Leetcode] 506. Relative Ranks
- LeetCode:Relative Ranks
- Leetcode #506 Relative Ranks
- LeetCode-506. Relative Ranks
- leetcode 506. Relative Ranks
- Leetcode 506:Relative Ranks
- LeetCode 506. Relative Ranks
- 【Leetcode】506. Relative Ranks
- LeetCode | 506. Relative Ranks
- LeetCode Relative Ranks
- [LeetCode]506. Relative Ranks
- leetcode 506. Relative Ranks
- LeetCode 506. Relative Ranks
- [leetcode]: 506. Relative Ranks
- 109.号码归属地双击实现居中
- Anglarjs 自定义服务
- Hi3516编译
- Sublime Text 3安装及常用插件安装
- 家庭理财之二
- LeetCode之Relative Ranks
- WeakHashMap
- 《MySQL高效编程》学习笔记--MySQL文件读取操作及使用
- 110.WindowManager.LayoutParams.type属性
- IdentityHashMap
- ConcurrentHashMap
- 111.归属地悬浮框的拖拽
- LinkedHashMap
- C++改变光标位置的函数