LeetCode - Largest Number (sort的cmp的写法)

Largest Number

 Total Accepted: 23153 Total Submissions: 146500My Submissions

Question Solution 

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.

如下：

class Solution {public:    string largestNumber(vector<int>& nums) {        vector<string> strs;        for(auto x : nums)            strs.push_back(to_string(x));        sort(strs.begin(), strs.end(), cmp);        string ans;        for(auto s : strs)            ans += s;        return ans[0] == '0' ? "0" : ans;    }private:    static bool cmp(string a, string b){        return a + b > b + a;    }    };