zoukankan      html  css  js  c++  java
  • 506Relative Ranks(LeetCode)

    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:

    1. N is a positive integer and won't exceed 10,000.
    2. All the scores of athletes are guaranteed to be unique.
      bool cmp(int a, int b) {
          return a > b;
      }
      class Solution {
      public:
          vector<string> findRelativeRanks(vector<int>& nums) {
                  vector<string> s(nums.size());
              vector<int> num = nums;
              int len = nums.size();
              sort(num.begin(), num.end(), cmp);
              for (int i = 0; i < len; i++)
              {
                  int a = num[i];
                  for (int j = 0; j < len; j++)
                  {
                      if (num[i] == nums[j] && i == 0)
                      {
                          s[j] = "Gold Medal";
                      }
                      if (num[i] == nums[j] && i == 1)
                      {
                              s[j] = "Silver Medal";
                      }
                      if (num[i] == nums[j] && i == 2)
                      {
                          s[j] = "Bronze Medal";
                      }
                      if (num[i] == nums[j] && i > 2)
                      {
                          s[j] = to_string(i+1);
                      }
                  }
              }
              return s;
          }
      };
  • 相关阅读:
    group by与聚合函数
    表联结
    项目延期 怎样规避风险
    虚拟机安装linux系统
    Cannot truncate a table referenced in a foreign key constraint
    李航--《统计学习方法总结》
    CART算法
    北航学长分享交流笔记
    CentOS7导入MySql数据表结构并显示表结构
    RedHat7安装mysql5.7数据库
  • 原文地址:https://www.cnblogs.com/wujufengyun/p/6781825.html
Copyright © 2011-2022 走看看