首页 > 代码库 > Largest Number
Largest Number
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.
C++代码实现：
#include<iostream>#include<string>#include<vector>using namespace std;class Solution {public: string largestNumber(vector<int> &num) { if(num.empty()) return ""; string ret; int i,j; while(!num.empty()) { i=0; for(j=1;j<(int)num.size();j++) { if((to_string(num[i])+to_string(num[j]))<(to_string(num[j])+to_string(num[i]))) i=j; } ret+=to_string(num[i]); num.erase(num.begin()+i); } while(ret.size()>1&&ret[0]==‘0‘) ret.erase(ret.begin()); return ret; }};int main(){ Solution s; vector<int> vec={3,30,34,5,9}; cout<<s.largestNumber(vec)<<endl;}
Largest Number
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。