JAVA_LeetCode 1763_Longest Nice Substring 풀이 class Solution { public String longestNiceSubstring(String s) { // 문자열의 가장 긴 하위 문자열을 구한다. String res = ""; for(int i = 0; i < s.length(); i++){ for(int j = i + 1; j <= s.length(); j++){ if(niceChk(s.substring(i, j)) && s.substring(i, j).length() > res.length() ){ res = s.substring(i, j); } } } return res; } public boolean niceChk(String sub){ for(char ch = 'a'; ch <= 'z'; ch++){ char ch2 = Character.toUpperCase(ch); if( (sub.indexOf(ch) !
= -1 && sub.i...
#
JAVA
#
JAVA_LeetCode1763
#
JAVA_LeetCode1763_LongestNiceSubstring
#
JAVA_LongestNiceSubstring
#
LeetCode1763_LongestNiceSubstring
