加入收藏 | 设为首页 | 会员中心 | 我要投稿 李大同 (https://www.lidatong.com.cn/)- 科技、建站、经验、云计算、5G、大数据,站长网!
当前位置: 首页 > 站长学院 > PHP教程 > 正文

leetcode 179: Largest Number

发布时间:2020-12-13 20:14:24 所属栏目:PHP教程 来源:网络整理
导读:Largest Number Total Accepted: 2269 Total Submissions: 15366 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 resul

Largest Number

Total Accepted: 2269 Total Submissions: 15366

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 is9534330.

Note: The result may be very large,so you need to return a string instead of an integer.

[分析]

按题目的要求,重写排序方法,然后排序便可.

[注意]

当1个数是另外一个数的前缀时,要注意顺序. 这里用了个小技能   比较   S1+S2 ? S2+S1 便可.

另外,leading zeros要去掉.

[CODE]

second try:

public class Solution { public String largestNumber(int[] arr) { Integer[] array = new Integer[arr.length]; int i = 0; for (int value : arr) { array[i++] = Integer.valueOf(value); } Arrays.sort(array,new Comparator<Integer>() { @Override public int compare(Integer a1,Integer a2) { int l1 = a1==0? 1 : (int) Math.log10(Math.abs(a1)) + 1; int l2 = a2==0? 1 : (int) Math.log10(Math.abs(a2)) + 1; long aa1 = (long) (a1 * Math.pow(10,l2) + a2); long aa2 = (long) (a2 * Math.pow(10,l1) + a1); return aa1>aa2 ? ⑴ : (aa1==aa2 ? 0 : 1); } } ); StringBuilder sb = new StringBuilder(); for(Integer e : array) { sb.append(e); } return sb.toString().replaceFirst("^0+(?!$)",""); } }



first edition:

public class Solution { public String largestNumber(int[] arr) { String[] strs = new String[arr.length]; for(int i=0; i<arr.length; i++) { strs[i] = Integer.toString(arr[i]); } Arrays.sort(strs,new Comparator<String>() { @Override public int compare(String s1,String s2) { String ss1 = s1 + s2; String ss2 = s2 + s1; int i=0; while(i<ss1.length()) { if(ss1.charAt(i)!=ss2.charAt(i)) { return ss1.charAt(i) - ss2.charAt(i); } ++i; } return 0; } } ); StringBuilder sb = new StringBuilder(); for(int i=strs.length⑴; i>=0; i--) { sb.append(strs[i]); } return sb.toString().replaceFirst("^0+(?!$)",""); } }


(编辑:李大同)

【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容!

    推荐文章
      热点阅读