*LeetCode-Largest Number
2015-10-02 06:34
274 查看
string有一个函数是compareTo 比较两个string大小 先比长度 然后每一位比 直到一个比一个大
所以写了一个comparator 但是注意要用两个string先前后加起来 使长度一样 才有可比性
public class Solution {
public String largestNumber(int[] nums) {
if ( nums == null || nums.length == 0 )
return "";
Comparator<String> comp = new Comparator<String> (){
public int compare ( String s1, String s2 ){
String res1 = s1 + s2;
String res2 = s2 + s1;
return res2.compareTo( res1 );
}
};
String [] strs = new String [ nums.length ];
for ( int i = 0; i < nums.length; i ++ ){
strs[ i ] = Integer.toString ( nums[ i ] );
}
Arrays.sort ( strs, comp );
if ( strs[ 0 ].equals ("0") )
return "0";
StringBuilder sb = new StringBuilder();
for ( String st : strs ){
sb.append ( st );
}
return sb.toString();
}
}
所以写了一个comparator 但是注意要用两个string先前后加起来 使长度一样 才有可比性
public class Solution {
public String largestNumber(int[] nums) {
if ( nums == null || nums.length == 0 )
return "";
Comparator<String> comp = new Comparator<String> (){
public int compare ( String s1, String s2 ){
String res1 = s1 + s2;
String res2 = s2 + s1;
return res2.compareTo( res1 );
}
};
String [] strs = new String [ nums.length ];
for ( int i = 0; i < nums.length; i ++ ){
strs[ i ] = Integer.toString ( nums[ i ] );
}
Arrays.sort ( strs, comp );
if ( strs[ 0 ].equals ("0") )
return "0";
StringBuilder sb = new StringBuilder();
for ( String st : strs ){
sb.append ( st );
}
return sb.toString();
}
}
相关文章推荐
- Regular Expression Matching
- Intrinsic lock & synchronization
- 分层的结果是我们离底层越来越远,结果是我们越来越依靠别人
- Adaboost 算法的原理与推导
- Best Time to Buy and Sell Stock IV
- Minimum Window Substring
- Dungeon Game
- 注册和登录的测试服务器搭建
- Expression Add Operators
- Insert Interval
- Android Api Demos登顶之路(八十五)Graphics-->PurgeableBitmap
- Shortest Palindrome
- gcc与g++的区别
- *LeetCode-Longest Palindromic Substring
- 2015-2016-1 《移动平台应用开发实践》学生博客列表
- spring的配置模式与注解模式基础
- [汇编语言]debug中用r命令修改cs、ip,并不能影响a命令的代码起始写入地址?
- HtmlUnit模拟登录网站时注意事项
- [Leetcode]Letter Combinations of a Phone Number My Submissions Question Solution
- LeetCode-Simplify Path