Given a list of non negative integers, arrange them such that they form the largest number.
Example 1:
Input: [10,2] Output: "210"
Example 2:
Input: [3,30,34,5,9] Output: "9534330"
难度:medium
题目:给定非负整数数组,重组其序使其形成最大值。
思路:定制排序算法的比较策略,nums[i]拼接nums[j] 与 nums[j]拼接nums[i] 相比。
Runtime: 51 ms, faster than 26.58% of Java online submissions for Largest Number.
Memory Usage: 35.7 MB, less than 100.00% of Java online submissions for Largest Number.
class Solution {
public String largestNumber(int[] nums) {
if (null == nums) {
return "0";
}
int n = nums.length;
String[] ss = new String[n];
for (int i = 0; i < n; i++) {
ss[i] = String.valueOf(nums[i]);
}
Arrays.sort(ss, (s1, s2) -> {
String s1s2 = s1 + s2;
String s2s1 = s2 + s1;
return s2s1.compareTo(s1s2);
});
StringBuilder sb = new StringBuilder();
for (int i = 0; i < n; i++) {
sb.append(ss[i]);
}
String result = new String(sb);
return '0' == result.charAt(0) ? "0" : result;
}
}
原文
https://segmentfault.com/a/1190000018147827
本站部分文章源于互联网,本着传播知识、有益学习和研究的目的进行的转载,为网友免费提供。如有著作权人或出版方提出异议,本站将立即删除。如果您对文章转载有任何疑问请告之我们,以便我们及时纠正。PS:推荐一个微信公众号: askHarries 或者qq群:474807195,里面会分享一些资深架构师录制的视频录像:有Spring,MyBatis,Netty源码分析,高并发、高性能、分布式、微服务架构的原理,JVM性能优化这些成为架构师必备的知识体系。还能领取免费的学习资源,目前受益良多

转载请注明原文出处:Harries Blog™ » 179. Largest Number