LCOJ - 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.

 

string int2str(int &i) {
	string s;
	stringstream ss(s);
	ss << i;

	return ss.str();
}

bool cmp(int x, int y) {
	string sx = int2str(x);
	string sy = int2str(y);

	return sx + sy > sy + sx;
}

class Solution {
public:
	string largestNumber(vector<int> &num) {
		sort(num.begin(), num.end(), cmp);
		string res = "";

		if (num[0] == 0)
			return "0";

		for (int i = 0; i < (int) num.size(); ++i)
			res += int2str(num[i]);
		return res;
	}
};