Largest Number--LeetCode

偏执的太偏执、 2022-08-07 12:58 280阅读 0赞

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.

思路：最后的总长是一定的，把每个整数转换为字符串，字符串排序，合并字符串

  1. #include <iostream>
  2. #include <string>
  3. #include <algorithm>
  4. #include <vector>
  5. using namespace std;
  7. string itostr(int num)
  8. {
  9.    int temp = num;
  10.    string result;
  11.    for(;temp != 0;)
  12.    {
  13.      result += (temp%10)+'0';
  14.      temp /=10;   
  15.    }
  16.    result.reserve();
  17.    return result;
  18. }
  19. string largestNumber(vector<int> &num) 
  20. {
  22.    vector<string> str(num.size());
  23.    string result;
  24.    int i,tmp;
  25.    for(i=0;i<num.size();i++)
  26.    {
  28.       str[i] =   itostr(num[i]);                   
  29.    }  
  30.    sort(str.begin(),str.end());
  31.    for(i=str.size()-1;i>=0;i--)
  32.     result += str[i];   
  33.    return result;   
  34. }
  36. int main()
  37. {
  38.     int array[] ={3, 30, 34, 5, 9};
  39.     vector<int> vec(array,array+sizeof(array)/sizeof(array[0]));
  40.     cout<<largestNumber(vec); 
  41.     system("pause");
  42.     return 0;
  43.     }

发表评论

表情：
评论列表 （有 0 条评论，280人围观）

还没有评论，来说两句吧...

相关阅读