leetcode + 组成的数字值最大，在于排序

点击打开链接

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <cstring>
#include <string.h>
#include <algorithm>
#include <vector>
#include <numeric>
#include <limits>
#include <math.h>
#include <queue>
#include <map>
#include <set>
#include <stack>
using namespace std;
bool cmp(int& a, int& b)//其实就是比较ab ba的大小
{
    long long ans1=10, ans2=10;
    int n1 = a/10, n2= b/10;
    while (n1) {
        ans1 *=10, n1/=10;
    }
    while (n2) {
        ans2 *=10, n2/=10;
    }
    return ans2*a+b > ans1*b+a;
}

class Solution {
public:
       string largestNumber(vector<int>& nums) {
        sort(nums.begin(), nums.end(), cmp);
        if(nums[0]==0) return "0";
        string ans="";
        int len = nums.size();
        for(int i=0;i<len;i++){
            ans += to_string(nums[i]);
        }
        return ans;
    }
};
int main()
{

    return 0;
}