[JAVA] 프로그래머스 - 1로 만들기

https://school.programmers.co.kr/learn/courses/30/lessons/181880

프로그래머스

 

 

 

 

 

 

 

정답 

 

class Solution {
    public int solution(int[] num_list) {
        int answer = 0;
        
        for(int n : num_list) {
            answer += makeOne(n);
        }
        
        return answer;
    }
    
    public int makeOne(int n)
    {
        int count = 0;
        while(n!=1)
        {
            if(n%2 == 0)
                n /=2;
            else
                n = (n-1)/2;
            count++;
        }
        return count;
    }
}

 

 

 

다른 사람의 풀이 

 

1)

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

 

 

2)

class Solution {
    public int solution(int[] num_list) {
        int answer = 0;

        for(int i = 0; i < num_list.length; i++){
            int n = num_list[i];
            while(n != 1){
                if(n % 2 == 0) {
                    n /= 2;
                    answer++;
                }
                else {
                    n = (n-1)/2;
                    answer++;
                }
            }

        }

        return answer;
    }
}