JAVA_LeetCode 1876_Substrings of Size Three with Distinct Characters

JAVA_LeetCode 1876_Substrings of Size Three with Distinct Characters 풀이 class Solution { public int countGoodSubstrings(String s) { int cnt = 0; // 3자리 문자열 중 각 문자가 다른경우를 체크한다. for(int i = 0; i < s.length() - 2; i++){ if( s.charAt(i) != s.charAt(i + 1) && s.charAt(i) !

= s.charAt(i + 2) && s.charAt(i + 1) != s.charAt(i + 2) ){ cnt++; } } return cnt; } } * 출처 https://leetcode.com/problems/substrings-of-size-three-with-distinct-characters...