-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathLargest Number.cpp
62 lines (55 loc) · 1.46 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
53
54
55
56
57
58
59
60
61
62
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
void print_vector(vector<string> x){
for(int i=0;i<x.size();i++){
cout << x[i] << " ";
}
cout << endl;
}
class Solution {
public:
string largestNumber(vector<int> &num) {
vector<string> res;
for(int i=0;i<num.size();i++){
res.push_back(to_string(num[i]));
}
sort(res.rbegin(),res.rend(), my_sort);
print_vector(res);
if(res[0]=="0")
return "0";
string s;
for(int i=0;i<num.size();i++){
s+=res[i];
}
return s;
}
static bool my_sort(const string& left, const string& right){
int s, y, diff;
diff = left.size()-right.size();
if(diff==0)
return left<right;
else if(diff<0){
if(right.substr(0,left.size())==left){
return right < (right.substr(left.size(),-diff) + left);
}
return left < right.substr(0,left.size());
}
else{
if(left.substr(0,right.size())==right){
return (left.substr(right.size(),diff) + right) < left;
}
return left.substr(0,right.size()) < right;
}
}
};
int main(){
int a[] = {824,938,1399,5607,6973,5703,9609,4398,8247};
int b[] = {121,12};
vector<int> v = vector<int>(b,b+2);
Solution s = Solution();
cout << s.largestNumber(v);
//cout<<s.my_sort("30","3");
}