Skip to content

Commit 5a24e65

Browse files
add 1796
1 parent c9618c0 commit 5a24e65

File tree

2 files changed

+24
-0
lines changed

2 files changed

+24
-0
lines changed

README.md

+1
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+
|1796|[Second Largest Digit in a String](https://leetcode.com/problems/second-largest-digit-in-a-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1796.java) ||Easy|String|
1112
|1792|[Maximum Average Pass Ratio](https://leetcode.com/problems/maximum-average-pass-ratio/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1792.java) ||Medium|Heap|
1213
|1791|[Find Center of Star Graph](https://leetcode.com/problems/find-center-of-star-graph/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1791.java) ||Medium|Graph|
1314
|1790|[Check if One String Swap Can Make Strings Equal](https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1790.java) ||Easy|String|
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,23 @@
1+
package com.fishercoder.solutions;
2+
3+
import java.util.ArrayList;
4+
import java.util.List;
5+
import java.util.TreeSet;
6+
7+
public class _1796 {
8+
public static class Solution1 {
9+
public int secondHighest(String s) {
10+
TreeSet<Integer> set = new TreeSet<>();
11+
for (char c : s.toCharArray()) {
12+
if (Character.isDigit(c)) {
13+
set.add(Character.getNumericValue(c));
14+
}
15+
}
16+
if (set.isEmpty() || set.size() == 1) {
17+
return -1;
18+
}
19+
List<Integer> list = new ArrayList<>(set);
20+
return list.get(list.size() - 2);
21+
}
22+
}
23+
}

0 commit comments

Comments
 (0)