-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathLargest-Number.cpp
52 lines (46 loc) · 1.36 KB
/
Largest-Number.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
#include <algorithm>
#include <iostream>
#include <list>
#include <math.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
class Solution
{
public:
string largestNumber(vector<int> &nums)
{
int num_size = nums.size();
vector<string> tmp;
for (int i = 0; i < num_size; i++)
tmp.push_back(to_string(nums[i]));
sort(tmp.begin(), tmp.end(), myCompare);
string res = "";
for (int i = 0; i < num_size; i++)
res = res + tmp[i];
/*删除前导0*/
while (res.size() > 1 && res[0] == '0')
res = res.substr(1);
return res;
}
static bool myCompare(const string A, const string B)
{
return A + B > B + A;
/*以下程序不知道为什么会出bug*/
// volatile int size = min(A.size(), B.size());
// for (int i = 0; i < size; i++)
// if (A[i] != B[i]) return A[i] > B[i];
// if (A.size() > size) return myCompare(A.substr(size), B);
// else if (B.size() > size) return myCompare(A, B.substr(size));
// else return true;
}
};
int main()
{
Solution S;
vector<int> v = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
cout << S.largestNumber(v);
return 0;
}