[LeetCode] Largest Number

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.

 

老题了，主要是搞懂cmp函数，前置0的处理还有待优化，不用copy两遍字符串。

bool cmp(const string s1, const string s2) {
    return (s1 + s2) > (s2 + s1);
}

class Solution {
public:
    string largestNumber(vector<int> &num) {
        vector<string> s_num(num.size());
        stringstream stream;
        for (int i = 0; i < num.size(); ++i) {
            stream << num[i];
            stream >> s_num[i];
            stream.clear();
        }
        sort(s_num.begin(), s_num.end(), cmp);
        string tmp_res;
        for (int i = 0; i < s_num.size(); ++i) {
            tmp_res += s_num[i];
        }
        string res;
        bool flag = false;
        for (int i = 0; i < tmp_res.size(); ++i) {
            if (tmp_res[i] != '0') {
                res.push_back(tmp_res[i]);
                flag = true;
            } else if (flag) {
                res.push_back(tmp_res[i]);
            }
        }
        if (!flag) res.push_back('0');
        return res;
    }
};

 因为字符串是从int转过来的，所以不会出现0123这样的数字，所以前置0只有一种情况，那就是“0”，所以处理前置0时只要考虑“0”这一种特殊情况就行了。

class Solution {
public:
    static bool cmp(const string &s1, const string &s2) {
        return (s1 + s2) > (s2 + s1);
    }
    string largestNumber(vector<int> &num) {
        vector<string> s_num(num.size());
        for (int i = 0; i < num.size(); ++i) {
            s_num[i] = to_string(num[i]);
        }
        sort(s_num.begin(), s_num.end(), cmp);
        string res;
        bool flag = false;
        for (int i = 0; i < s_num.size(); ++i) {
            if (s_num[i] != "0") {
                res += s_num[i];
                flag = true;
            } else if (flag) {
                res += s_num[i];
            }
        }
        if (!flag) res.push_back('0');
        return res;
    }
};