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

Commit09a30b5

Browse files
add 2160
1 parente547fc1 commit09a30b5

File tree

2 files changed

+31
-0
lines changed

2 files changed

+31
-0
lines changed

‎README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
88

99
| # | Title | Solutions | Video | Difficulty | Tag
1010
|-----|----------------|---------------|--------|-------------|-------------
11+
|2160|[Minimum Sum of Four Digit Number After Splitting Digits](https://leetcode.com/problems/minimum-sum-of-four-digit-number-after-splitting-digits/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2160.java)||Easy||
1112
|2156|[Find Substring With Given Hash Value](https://leetcode.com/problems/find-substring-with-given-hash-value/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2156.java)||Medium||
1213
|2155|[All Divisions With the Highest Score of a Binary Array](https://leetcode.com/problems/all-divisions-with-the-highest-score-of-a-binary-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2155.java)||Medium||
1314
|2154|[Keep Multiplying Found Values by Two](https://leetcode.com/problems/keep-multiplying-found-values-by-two/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2154.java)||Easy||
Lines changed: 30 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,30 @@
1+
packagecom.fishercoder.solutions;
2+
3+
importjava.util.Arrays;
4+
5+
publicclass_2160 {
6+
publicstaticclassSolution1 {
7+
publicintminimumSum(intnum) {
8+
int[]digits =newint[4];
9+
inti =0;
10+
while (num !=0) {
11+
digits[i++] =num %10;
12+
num /=10;
13+
}
14+
Arrays.sort(digits);
15+
intnum1 =0;
16+
if (digits[0] ==0) {
17+
num1 =digits[3];
18+
}else {
19+
num1 =digits[0] *10 +digits[3];
20+
}
21+
intnum2 =0;
22+
if (digits[1] ==0) {
23+
num2 =digits[2];
24+
}else {
25+
num2 =digits[1] *10 +digits[2];
26+
}
27+
returnnum1 +num2;
28+
}
29+
}
30+
}

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp