Problem:
Solution:
求所给整数数组中各元素的相对大小,最大的为“gold”,第二大为“silver”依次类推。我想到的办法是创建一个辅助数组ss,用来记录各元素的相对大小,然后遍历这个辅助数组将结果存放到string数组res中进行输出。这种方式的时间复杂度为O(n^2),空间复杂度为O(n)
class Solution {
public:
vector<string> findRelativeRanks(vector<int>& nums) {
int len = nums.size();
int record;
int ss[len] = {0};
vector<string> res;
int max;
int j;
for (int i = 0;i < len;i++)
{
record = 0;
max = -1;
for (j = 0; j < len; j++)
{
if (max < nums[j])
{
max = nums[j];
record = j;
}
}
ss[record] = i+1;
nums[record] = -1;
}
for (int i = 0;i < len;i++)
{
if (ss[i] == 1) res.push_back("Gold Medal");
else if (ss[i] == 2) res.push_back("Silver Medal");
else if (ss[i] == 3) res.push_back("Bronze Medal");
else res.push_back(to_string(ss[i]));
}
return res;
}
};