We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 7b018d0 commit a768c2cCopy full SHA for a768c2c
Easy/Longest Nice Substring.java
@@ -0,0 +1,14 @@
1
+class Solution {
2
+ public String longestNiceSubstring(String s) {
3
+ Set<Character> set = s.chars().mapToObj(c -> (char) c).collect(Collectors.toSet());
4
+ for (int i = 0; i < s.length(); i++) {
5
+ char c = s.charAt(i);
6
+ if (!(set.contains(Character.toLowerCase(c)) && set.contains(Character.toUpperCase(c)))) {
7
+ String left = longestNiceSubstring(s.substring(0, i));
8
+ String right = longestNiceSubstring(s.substring(i + 1));
9
+ return left.length() >= right.length() ? left : right;
10
+ }
11
12
+ return s;
13
14
+}
0 commit comments