Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commitb362c92

Browse files
add a solution for 179
1 parent8bc172c commitb362c92

File tree

2 files changed

+133
-79
lines changed

2 files changed

+133
-79
lines changed
Lines changed: 80 additions & 79 deletions
Original file line numberDiff line numberDiff line change
@@ -1,89 +1,90 @@
11
packagecom.fishercoder.solutions;
22

3-
importjava.util.Arrays;
4-
importjava.util.Comparator;
3+
importjava.util.*;
54

6-
/**
7-
* 179. Largest Number
8-
9-
Given a list of non negative integers, arrange them such that they form the largest number.
10-
11-
Example 1:
12-
13-
Input: [10,2]
14-
Output: "210"
15-
16-
Example 2:
17-
18-
Input: [3,30,34,5,9]
19-
Output: "9534330"
20-
21-
Note: The result may be very large, so you need to return a string instead of an integer.
22-
*/
235
publicclass_179 {
246

25-
publicstaticclassSolution1 {
26-
publicStringlargestNumber(int[]num) {
27-
if (num.length ==0) {
28-
return"";
29-
}
30-
if (num.length ==1) {
31-
returnInteger.toString(num[0]);
32-
}
33-
String[]str =newString[num.length];
34-
for (inti =0;i <num.length;i++) {
35-
str[i] =Integer.toString(num[i]);
36-
}
37-
Arrays.sort(str,newStringComparator());
38-
StringBuildersb =newStringBuilder("");
39-
for (inti =num.length -1;i >=0;i--) {
40-
sb.append(str[i]);
41-
}
42-
if (sb.charAt(0) =='0') {
43-
return"0";
44-
}
45-
returnsb.toString();
46-
}
47-
48-
classStringComparatorimplementsComparator<String> {
49-
publicintcompare(Strings1,Strings2) {
50-
if (s1.length() ==0 &&s2.length() ==0) {
51-
return0;
52-
}
53-
if (s2.length() ==0) {
54-
return1;
55-
}
56-
if (s1.length() ==0) {
57-
return -1;
58-
}
59-
for (inti =0;i <s1.length() &&i <s2.length();i++) {
60-
if (s1.charAt(i) >s2.charAt(i)) {
61-
return1;
62-
}elseif (s1.charAt(i) <s2.charAt(i)) {
63-
return -1;
64-
}
7+
publicstaticclassSolution1 {
8+
publicStringlargestNumber(int[]num) {
9+
if (num.length ==0) {
10+
return"";
11+
}
12+
if (num.length ==1) {
13+
returnInteger.toString(num[0]);
14+
}
15+
String[]str =newString[num.length];
16+
for (inti =0;i <num.length;i++) {
17+
str[i] =Integer.toString(num[i]);
18+
}
19+
Arrays.sort(str,newStringComparator());
20+
StringBuildersb =newStringBuilder("");
21+
for (inti =num.length -1;i >=0;i--) {
22+
sb.append(str[i]);
23+
}
24+
if (sb.charAt(0) =='0') {
25+
return"0";
26+
}
27+
returnsb.toString();
6528
}
66-
if (s1.length() ==s2.length()) {
67-
return0;
29+
30+
classStringComparatorimplementsComparator<String> {
31+
publicintcompare(Strings1,Strings2) {
32+
if (s1.length() ==0 &&s2.length() ==0) {
33+
return0;
34+
}
35+
if (s2.length() ==0) {
36+
return1;
37+
}
38+
if (s1.length() ==0) {
39+
return -1;
40+
}
41+
for (inti =0;i <s1.length() &&i <s2.length();i++) {
42+
if (s1.charAt(i) >s2.charAt(i)) {
43+
return1;
44+
}elseif (s1.charAt(i) <s2.charAt(i)) {
45+
return -1;
46+
}
47+
}
48+
if (s1.length() ==s2.length()) {
49+
return0;
50+
}
51+
if (s1.length() >s2.length()) {
52+
if (s1.charAt(0) <s1.charAt(s2.length())) {
53+
return1;
54+
}elseif (s1.charAt(0) >s1.charAt(s2.length())) {
55+
return -1;
56+
}else {
57+
returncompare(s1.substring(s2.length()),s2);
58+
}
59+
}else {
60+
if (s2.charAt(0) <s2.charAt(s1.length())) {
61+
return -1;
62+
}elseif (s2.charAt(0) >s2.charAt(s1.length())) {
63+
return1;
64+
}else {
65+
returncompare(s1,s2.substring(s1.length()));
66+
}
67+
}
68+
}
6869
}
69-
if (s1.length() >s2.length()) {
70-
if (s1.charAt(0) <s1.charAt(s2.length())) {
71-
return1;
72-
}elseif (s1.charAt(0) >s1.charAt(s2.length())) {
73-
return -1;
74-
}else {
75-
returncompare(s1.substring(s2.length()),s2);
76-
}
77-
}else {
78-
if (s2.charAt(0) <s2.charAt(s1.length())) {
79-
return -1;
80-
}elseif (s2.charAt(0) >s2.charAt(s1.length())) {
81-
return1;
82-
}else {
83-
returncompare(s1,s2.substring(s1.length()));
84-
}
70+
}
71+
72+
publicstaticclassSolution2 {
73+
/**
74+
* My completely original solution on 11/29/2021:
75+
* we'll just sort these numbers as if they are strings.
76+
*/
77+
publicStringlargestNumber(int[]nums) {
78+
List<String>strings =newArrayList<>();
79+
for (intnum :nums) {
80+
strings.add(Integer.toString(num));
81+
}
82+
Collections.sort(strings, (a,b) -> (b +a).compareToIgnoreCase(a +b));
83+
StringBuildersb =newStringBuilder();
84+
for (inti =0;i <strings.size();i++) {
85+
sb.append(strings.get(i));
86+
}
87+
returnsb.charAt(0) =='0' ?"0" :sb.toString();
8588
}
86-
}
8789
}
88-
}
8990
}
Lines changed: 53 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,53 @@
1+
packagecom.fishercoder;
2+
3+
importcom.fishercoder.solutions._179;
4+
importorg.junit.BeforeClass;
5+
importorg.junit.Test;
6+
7+
importstaticorg.junit.Assert.assertEquals;
8+
9+
publicclass_179Test {
10+
privatestatic_179.Solution1solution1;
11+
privatestatic_179.Solution2solution2;
12+
privatestaticint[]nums;
13+
privatestaticStringexpected;
14+
15+
@BeforeClass
16+
publicstaticvoidsetup() {
17+
solution1 =new_179.Solution1();
18+
solution2 =new_179.Solution2();
19+
}
20+
21+
@Test
22+
publicvoidtest1() {
23+
nums =newint[]{34323,3432};
24+
expected ="343234323";
25+
assertEquals(expected,solution1.largestNumber(nums));
26+
assertEquals(expected,solution2.largestNumber(nums));
27+
}
28+
29+
@Test
30+
publicvoidtest2() {
31+
nums =newint[]{111311,1113};
32+
expected ="1113111311";
33+
assertEquals(expected,solution1.largestNumber(nums));
34+
assertEquals(expected,solution2.largestNumber(nums));
35+
}
36+
37+
@Test
38+
publicvoidtest3() {
39+
nums =newint[]{3,30,34,5,9};
40+
expected ="9534330";
41+
assertEquals(expected,solution1.largestNumber(nums));
42+
assertEquals(expected,solution2.largestNumber(nums));
43+
}
44+
45+
@Test
46+
publicvoidtest4() {
47+
nums =newint[]{0,0};
48+
expected ="0";
49+
assertEquals(expected,solution1.largestNumber(nums));
50+
assertEquals(expected,solution2.largestNumber(nums));
51+
}
52+
53+
}

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp