题解 | #合并区间#
最大数
http://www.nowcoder.com/practice/fc897457408f4bbe9d3f87588f497729
class Solution {
public:
/**
* 最大数
* @param nums int整型vector
* @return string字符串
*/
string solve(vector<int>& nums) {
vector<string>s;
string string1;
//将整型数组转化为string类型数组
for (int i = 0; i < nums.size(); i++) {
s.push_back(to_string(nums[i]));
}
for (int i = 0; i < s.size() - 1; i++) {
for (int j = 0; j < s.size() -1 - i; j++) {
if ((s[j] + s[j + 1]) < (s[j + 1] + s[j])) {
swap(s[j], s[ j + 1]);
}
}
}
for (int i = 0; i < s.size(); i++) {
if (s[0] == "0") return s[0];
string1 = string1 + s[i];
}
return string1;
}
}; 
查看20道真题和解析
