Skip to content

Commit 422242e

Browse files
add 2259
1 parent 3ed6851 commit 422242e

File tree

2 files changed

+27
-1
lines changed

2 files changed

+27
-1
lines changed

README.md

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

99
| # | Title | Solutions | Video | Difficulty | Tag
1010
|------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|-------------|-------------
11-
| 2256 |[Minimum Average Difference](https://leetcode.com/problems/minimum-average-difference/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2256.java) || Medium ||
11+
| 2259 |[Remove Digit From Number to Maximize Result](https://leetcode.com/problems/remove-digit-from-number-to-maximize-result/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2259.java) || Easy ||
12+
| 2256 |[Minimum Average Difference](https://leetcode.com/problems/minimum-average-difference/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2256.java) || Medium ||
1213
| 2255 |[Count Prefixes of a Given String](https://leetcode.com/problems/count-prefixes-of-a-given-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2255.java) || Easy ||
1314
| 2248 |[Intersection of Multiple Arrays](https://leetcode.com/problems/intersection-of-multiple-arrays/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2248.java) || Easy ||
1415
| 2244 |[Minimum Rounds to Complete All Tasks](https://leetcode.com/problems/minimum-rounds-to-complete-all-tasks/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2244.java) || Medium ||
Lines changed: 25 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,25 @@
1+
package com.fishercoder.solutions;
2+
3+
import java.util.ArrayList;
4+
import java.util.Collections;
5+
import java.util.List;
6+
7+
public class _2259 {
8+
public static class Solution1 {
9+
public String removeDigit(String number, char digit) {
10+
StringBuilder sb = new StringBuilder();
11+
List<String> nums = new ArrayList<>();
12+
String result = "";
13+
for (int i = 0; i < number.length(); i++) {
14+
if (number.charAt(i) == digit) {
15+
sb.append(number.substring(0, i));
16+
sb.append(number.substring(i + 1));
17+
nums.add(sb.toString());
18+
sb.setLength(0);
19+
}
20+
}
21+
Collections.sort(nums, Collections.reverseOrder());
22+
return nums.get(0);
23+
}
24+
}
25+
}

0 commit comments

Comments
 (0)