[알고리즘] 1로 만들기 Java

 

class Solution {
    public int solution(int[] num_list) {
        int answer = 0;
        for (int i = 0; i < num_list.length; i++) {
          if (num_list[i] % 2 != 0) {
            num_list[i] = num_list[i] - 1;
          }
          while (num_list[i] > 1) {
            num_list[i] = num_list[i] / 2;
            answer += 1;
          }
        }
        return answer;
    }
}