题目描述
给定一组非负整数 nums
,重新排列每个数的顺序(每个数不可拆分)使之组成一个最大的整数。
注意:输出结果可能非常大,所以你需要返回一个字符串而不是整数。
示例 1:
输入:nums = [10,2]
输出:"210"
代码
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
using namespace std;
// Custom comparator function
bool compare(const string& x, const string& y) {
return x + y > y + x;
}
class Solution {//O(nlognlogm) O(logn)
public:
string largestNumber(vector<int>& nums) {
// Convert all numbers to strings
vector<string> numStrs;
for (int num : nums) {
numStrs.push_back(to_string(num));
}
// Sort numbers based on custom comparator
sort(numStrs.begin(), numStrs.end(), compare);
// Join sorted numbers into a single string
string result;
for (const string& numStr : numStrs) {
result += numStr;
}
// Handle the edge case where the result is all zeros
if (result[0] == '0') {
return "0";
}
return result;
}
};
vector<int> split(string params_str) {
vector<int> p;
while (params_str.find(",") != string::npos) {
int found = params_str.find(",");
p.push_back(stoi(params_str.substr(0, found)));
params_str = params_str.substr(found + 1);
}
p.push_back(stoi(params_str));
return p;
}
//nums = [10,2] 输出:210
int main() {
string input;
getline(cin, input);
input = input.substr(1, input.length() - 2); // Remove square brackets
istringstream iss(input);
vector<int> nums;
string numStr;
while (getline(iss, numStr, ',')) {
nums.push_back(stoi(numStr));
}
Solution a;
cout << a.largestNumber(nums);
}