日韩性视频-久久久蜜桃-www中文字幕-在线中文字幕av-亚洲欧美一区二区三区四区-撸久久-香蕉视频一区-久久无码精品丰满人妻-国产高潮av-激情福利社-日韩av网址大全-国产精品久久999-日本五十路在线-性欧美在线-久久99精品波多结衣一区-男女午夜免费视频-黑人极品ⅴideos精品欧美棵-人人妻人人澡人人爽精品欧美一区-日韩一区在线看-欧美a级在线免费观看

歡迎訪問 生活随笔!

生活随笔

當前位置: 首頁 > 编程资源 > 编程问答 >内容正文

编程问答

LeetCode之Relative Ranks

發布時間:2023/12/4 编程问答 30 豆豆
生活随笔 收集整理的這篇文章主要介紹了 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 "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;} }

    總結

    以上是生活随笔為你收集整理的LeetCode之Relative Ranks的全部內容,希望文章能夠幫你解決所遇到的問題。

    如果覺得生活随笔網站內容還不錯,歡迎將生活随笔推薦給好友。