LeetCode---(197)Largest Number
来源:互联网 发布:上海兄弟连java学费 编辑:程序博客网 时间:2024/06/08 16:25
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.
class Solution {public: static bool cmp(string a,string b) { string c1=a+b; string c2=b+a; return c1>c2; } string largestNumber(vector<int>& nums) { if(nums.size()==0) return ""; vector<string> num_str; for(int i=0;i<nums.size();i++) num_str.push_back(to_string(nums[i])); sort(num_str.begin(),num_str.end(),cmp); string res=""; for (int i = 0; i < num_str.size(); i++) res += num_str[i]; if (res[0] == '0') return "0"; return res; }};
0 0
- LeetCode---(197)Largest Number
- Largest Number @leetCode
- LeetCode : Largest Number
- Leetcode Largest Number
- [LeetCode] Largest Number
- [leetcode]179 Largest Number
- [LeetCode] Largest Number
- Leetcode Largest Number
- [LeetCode]Largest Number
- leetcode 179: Largest Number
- 【LeetCode】Largest Number
- 【Leetcode】Largest Number
- [LeetCode]179.Largest Number
- LeetCode: Largest Number
- Largest Number|leetcode解决方案
- leetcode 之Largest Number
- [leetcode] Largest Number
- LeetCode(179) Largest Number
- Immediate Decodability
- 3.3EPT内存虚拟化
- 并查集应用食物链poj1182
- 打鱼还是晒网
- 通过函数回调排序结构体数组
- LeetCode---(197)Largest Number
- 3.4Shadowpage页表虚拟化
- J2ee入门之开发环境搭建
- POJ 1436 Horizontally Visible Segments(线段树区间染色问题)
- 代码评审这点事,元芳你怎么看
- c++学习日记 1
- Being a Hero (hdu 3251 最小割 好题)
- scikit-learn:4.7. Pairwise metrics, Affinities and Kernels
- IO流(复制文本文件的5种方式案例(用字符流)