题解 | #把数组排成最小的数#

using namespace std;
class Solution {
public:
    string PrintMinNumber(vector<int> numbers) {
        cout<<"jjsfjsd"<<endl;
        int st;
        string str;
        cout<<"开始执行"<<endl;
        for(int i = 0; i < numbers.size(); i++){
            for(int j = i+1; j < numbers.size(); j++){
                if(greater(numbers[i],numbers[j])){
                    st = numbers[i];
                    numbers[i] = numbers[j];
                    numbers[j] = st;
                }
            }
        }
        for(int i = 0; i < numbers.size(); i++){
            str.append(to_string(numbers[i]));
        }
        return str;
    }
    
    bool greater(int a , int b){
        int c = a, d = b;
        vector<int> r1;
        vector<int> r2;
        int num = 0;
        cout<<"第一个数"<<endl;

        while(c / 10){
            num++;
            c = c / 10; 
        }
        cout<<num<<endl;
        while(num >= 0){
            c = a / (pow(10,num));
            a = a - c * pow(10,num);
            r1.push_back(c);
            num--;
            cout<<num<<endl;
        }
        cout<<r1[0]<<r1[1]<<endl;
       
        for(int i = 0; i < r1.size();i++){
            cout<<" r1 "<<r1[i]<<endl;
        }

        cout<<"第二个数"<<endl;
        
        num = 0;
        while(d / 10){
            num++;
            d = d / 10;
        }
        
        cout<<num<<endl;
        
        while(num >= 0){
            d = b / (pow(10,num));
            b = b - d * pow(10,num);
            r2.push_back(d);
            num--;
            cout<<num<<endl;
        }
        for(int i = 0; i < r2.size();i++){
            cout<<" r2 "<<r2[i]<<endl;
        }
        for(int i = 0; i < min(r1.size(),r2.size()); i++){
            cout<<"比较"<<r1[i]<<"   "<<r2[i]<<endl;
            if(r1[i] > r2[i]){
                return true;
            }
            if(r1[i] < r2[i]){
                return false;
            }
        }
        
        
        if(r2.size() > r1.size()){
            int ab = r1.size();
            while(ab < r2.size()){
                  if( r2[ab] > r1[0]){
                     cout<<" size is equal  "<<r2[ab]<<">"<<r1[0]<<endl;
                     cout<<"false"<<endl;
                     return false;
                  }if( r2[ab] < r1[0]){
                     cout<<" size is equal  "<<r2[ab]<<"<"<<r1[0]<<endl;

                     return true;
                  }
                ab++;
            }
        }
      
        if(r1.size() > r2.size()){
            int ab = r2.size();
            while(ab < r1.size()){
                  if( r1[ab] > r2[0]){
                     cout<<" size is equal  "<<r1[ab]<<">"<<r2[0]<<endl;
                     cout<<"false"<<endl;
                     return true;
                  }if( r1[ab] < r2[0]){
                     cout<<" size is equal  "<<r1[ab]<<"<"<<r2[0]<<endl;

                     return false;
                  }
                ab++;
            }
        }
        return true;
    }
};