JAVA_LeetCode 1758_Minimum Changes To Make Alternating Binary String 풀이 class Solution { public int minOperations(String s) { // 각 짝/홀수인 경우 변경 시 값을 체크해준다. int chk = 0, chk2 = 0; for(int i = 0; i < s.length(); i++){ if(i % 2 == 0) chk += (s.charAt(i) == '0') ? 0 : 1; else chk += (s.charAt(i) == '1') ?
0 : 1; if(i % 2 == 0) chk2 += (s.charAt(i) == '1') ? 0 : 1; else chk2 += (s.charAt(i) == '0') ?
0 : 1; } return Math.min(chk, chk2); } } * 출처 https://leetcode.com/problems/minimum-changes-to-make-al...
#
JAVA
#
JAVA_LeetCode1758
#
JAVA_LeetCode1758_MinimumChangesToMakeAlternatingBinaryString
#
JAVA_MinimumChangesToMakeAlternatingBinaryString
#
LeetCode1758_MinimumChangesToMakeAlternatingBinaryString
