Interviewbit/LargestNumber.cpp at master · jayakrishna-g/Interviewbit · GitHub

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
/*Question:
Largest Number
Asked in:
Amazon
Goldman Sachs
Microsoft
Given a list of non negative integers, arrange them such that they form the largest number.

For example:

Given [3, 30, 34, 5, 9], the largest formed number is 9534330.

Note: The result may be very large, so you need to return a string instead of an integer.
*/
bool cmp(string a,string b)
    {
        string a1=a.append(b);
        string b1=b.append(a);
        return a1>b1;
    }
string Solution::largestNumber(const vector<int> &A) {
    vector<string> s;
    for(int i=0;i<A.size();i++)
    {
        s.push_back(to_string(A[i]));
    }

    sort(s.begin(),s.end(),cmp);

    string ans="";
    for(string a:s)
    ans+=a;
    string fans="";
    if(ans[0]=='0')
    {
        int i=0;
        for(;i<ans.size();i++)
        {
            if(ans[i]!='0')
            break;
        }
        for(;i<ans.size();i++)
        fans+=ans[i];
        if(fans=="")
        return "0";
        return fans;
    }
    return ans;
}