JAVA_LeetCode 2379_Minimum Recolors to Get K Consecutive Black Blocks

JAVA_LeetCode 2379_Minimum Recolors to Get K Consecutive Black Blocks 풀이 class Solution { public int minimumRecolors(String blocks, int k) { // k 길이중 'W'를 찾은 값과 최소값을 비교하여 가장 최소값을 반환한다. int res = Integer.MAX_VALUE, min = 0; for(int i = 0; i < blocks.length() - k + 1; i++) { min = 0; for(int j = i; j < i + k; j++) { if(blocks.charAt(j) == 'W') min++; } res = Math.min(min, res); } return res; } } * 출처 https://leetcode.com/problems/minimum-recolors-to-get-k-consecutive-black-blocks...