Largest Number 最大组合数

1. 很简单的一道题，先写出我的算法。
2. #include
   #include
   #include
   #include
   #include
   #include
   #include
   using namespace std;
   int wei(int n)
   {
   int num = 0;
   while (n)
   {
   n = n / 10;
   num++;
   }
   return num;
   }
   int get10N(int n)
   {
   int sum = 1;
   for (int i = 1; i <= n; i++)
   {
   sum = sum * 10;
   }
   return sum;
   }
   bool cmp(int &num1, int &num2)
   {
   if (num1 == 0)
   {
   return false;
   }
   if (num2 == 0)
   {
   return true;
   }
   int wei1 = wei(num1);
   int wei2 = wei(num2);
   int sum1 = num1get10N(wei2)+num2;
   int sum2 = num2get10N(wei1)+num1;
   return sum1 > sum2;

}
string num2str(int n)
{
string str1 = “”;
while (n)
{
int remind = n % 10;
char ch1 = ‘0’ + remind;
n = n / 10;
str1 = ch1 + str1;
}
return str1;
}
string LargestNumber(vector &vec)
{
string str1 = “”;
sort(vec.begin(), vec.end(), cmp);
for (int i = 0; i < vec.size(); i++)
{
str1 = str1 + num2str(vec[i]);
}

return str1;

}
int main()
{
vector vecInt;
vecInt.push_back(0);
vecInt.push_back(48);
srand((unsigned)time(NULL));
for (int i = 0; i < 5; i++)
vecInt.push_back(rand()%100);
for (auto x : vecInt)
{
cout << x << " ";
}
cout << endl;
cout << LargestNumber(vecInt) << endl;
cout << endl;
system(“pause”);
return 0;
}
实际上各个数组元素的排序就是一个字符串的字典排序。
string的to_string函数可以很方便的把数字转换成字符串。
bool cmp1(int &num1, int &num2)
{
return to_string(num1) + to_string(num2) > to_string(num2) + to_string(num1);
}
string LargestNumberT(vector &vec)
{
string str1 = “”;
sort(vec.begin(), vec.end(), cmp1);
for (int i = 0; i < vec.size(); i++)
{
str1 = str1 + to_string(vec[i]);
}
return str1;
}
很简单有没有
记得to_string的这个函数啊啊