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.

将数组排序，这里面现将整型数转化为字符串，然后用选择法排序。

class Solution {
public:
	string largestNumber(vector<int>& nums) {
		vector<string> res1;
		string result = "";
		char a[10];
		for (int i = 0; i<nums.size(); i++)
		{
			sprintf(a, "%d", nums[i]);
			result += a;
			res1.push_back(result);
			result = "";
		}
		for (int j = 0; j<res1.size() - 1; j++)
		{
			for (int k = j + 1; k<res1.size(); k++)
			{
				if (isless(res1[j], res1[k]))
				{
					string temp;
					temp = res1[j];
					res1[j] = res1[k];
					res1[k] = temp;
				}
			}
		}
		if(strcmp(res1[0].c_str(),"0") == 0)
		    return "0";
		for (int l = 0; l<res1.size(); l++)
		{
			result = result + res1[l];
		}
		return result;
	}
	bool isless(string str1, string str2)
	{
		if (strcmp((str1+str2).c_str(), (str2+str1).c_str()) < 0)
		{
			return true;
		}
		else
		{
			return false;
		}
		return false;
	}
};