关于给定数组依照频次降序摆放，并坚持排序的稳定性。A8站源码交易平台
思路：用一个vector记载呈现的频次，一个vector记载该数字，遍历时运用map
记载是否呈现过并记载保存频次的方位。
代码如下：
#include
#include
#include
using namespace std;
vectorsalaryfrequeny(int num, int * salaries)
{
vectorresult;
if (num <= 0)
return result;
vectortimes;
vectorname;
map
int index = 0;
for (int i = 0; i < num; i++)
{
int value = salaries[i];
if (m.count(value) == 0)
{
m[value] = index++;
times.push_back(1);
name.push_back(value);
}
else
{
times[m[value]] += 1;
}
}
int len = name.size();
for (int i = 0; i < len - 1;i++)
for (int j = i+1; j < len; j++)
{
if (times[i] < times[j])
{
int temp = times[i];
times[i] = times[j];
times[j] = temp;
temp = name[i];
name[i] = name[j];
name[j] = temp;
}
}
/*for (int i = 0; i < len;i++)
for (int j = 0; j < times[i]; j++)
result.push_back(name[i]);*/
for (int i = 0; i < len; i++)
result.insert(result.end(), times[i], name[i]);
return result;
}
int main()
{
const int num = 10;
int salaries[num] = { 20, 40, 26, 25, 40, 20, 40, 20, 40, 25 };
vectorresult = salaryfrequeny(num, salaries);
int len = result.size();
for (int i = 0; i < len; i++)
cout << result[i] << " ";
cout << endl;
system("pause");
return 0;
}
以上代码或许时刻复杂度稍高，对其速度方面稍作优化，使用hash_map来做，其无序，自身就具有稳定性。A8站源码交易平台
#include
#include
#include
#include
using namespace std;
vectorsalaryfrequeny(int num, int * salaries)
{
vectorresult;
hash_map
