179.Largest Number
来源:互联网 发布:js 数组循环 编辑:程序博客网 时间:2024/06/04 19:11
近期开始在LeetCode上开始刷题,第一道题是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.
/*179. Largest Number*/#include<iostream>#include<string>#include<vector>#include<algorithm>#include<cstdio>using namespace std;class Solution {public: string largestNumber(vector<int>& nums) { vector<string> sortArray; string result; char temp[256]; int index = 0, length = 0; for( vector<int>::iterator it = nums.begin(); it != nums.end(); it++ ) { sprintf( temp, "%d", *it ); sortArray.push_back(temp); } sort(sortArray.begin() , sortArray.end(), sortByWay ); for( index = sortArray.size()-1; index >= 0; index-- ) { //cout<< sortArray[ index ]<<endl; result.append( sortArray[ index ] ); } return result; } static bool sortByWay( const string& num1, const string& num2 ) { return num1 < num2; }};
然后将代码提交到LeetCode官网上,却出现了如下的结果:
仔细想一下,针对这个用例,我设计算法的时候的确没有想到,所以又重新实现了该问题的解。根据多次提交根据时测试用例的结果进行修改,终于通过了,最后的结果如图:
代码如下:
class Solution {public: string largestNumber(vector<int>& nums) { vector<string> sortArray; string result; char temp[256]; int index = 0, flag = 1; for( vector<int>::iterator it = nums.begin(); it != nums.end(); it++ ) { if( *it != 0 ) flag = 0; sprintf( temp, "%d", *it ); sortArray.push_back(temp); } if( flag ) { result.append("0"); return result; } sort(sortArray.begin() , sortArray.end(), sortByWay ); for( index = sortArray.size()-1; index >= 0; index-- ) //cout<< sortArray[ index ]<<endl; result.append( sortArray[ index ] ); return result; } static bool sortByWay( const string& num1, const string& num2 ) { string temp1( num1 ); string temp2( num2 ); temp1.append( num2 ); temp2.append( num1 ); return temp1 < temp2; }};
0 0
- [LeetCode]179.Largest Number
- LeetCode 179. Largest Number
- 179.Largest Number
- [leetcode] 179.Largest Number
- 【leetocde】179. Largest number
- [LeetCode]179. Largest Number
- 179. Largest Number LeetCode
- 179. Largest Number
- leetcode 179. Largest Number
- 179. Largest Number
- 179.Largest Number
- 179. Largest Number
- 179. Largest Number
- 179. Largest Number
- LeetCode 179. Largest Number
- [leetcode] 179. Largest Number
- leetcode.179. Largest Number
- 179. Largest Number
- 七层协议详解
- Android 自定义控件之第三讲:obtainStyledAttributes 系列函数详解
- 【有毒的设计模式】单一指责原则、开放-封闭原则、依赖倒转原则、里氏代换原则
- Quartz任务调度(1)概念例析快速入门
- 一步步点亮LED5_汇编编写延时函数并实现LED闪烁效果
- 179.Largest Number
- poj-2255-Tree Recovery
- HDU 1394 线段树
- TCP三次握手四次挥手blog.csdn.net/whuslei
- 雪碧图-初识
- 《Linux操作系统分析》之分析系统调用system_call的处理过程
- 最简单最快的实现底部标签导航(仿闲鱼样式)
- 国内上谷歌搜索方法之谷粉搜搜
- 第五周实践项目1————三角形类雏形(1)