LeetCode (Largest Number)

Problem:

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.

Solution:

class Solution {public:    string largestNumber(vector<int>& nums) {        string ans = "";        vector<string> s_nums;        for(auto n : nums)            s_nums.push_back(to_string(n));        sort(s_nums.begin(), s_nums.end(), [](string s1, string s2){return s1 + s2> s2 + s1;});        for(auto s : s_nums)            ans += s;        while(ans[0] == '0' && ans.size() > 1)            ans.erase(0, 1);        return ans;    }};