![프로그래머스 Lv.0 1로 만들기](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FQ44zh%2FbtsD3b3VsWY%2Freszexik92Z6Ktm4KraNx0%2Fimg.png)
개발자가 되기까지 (2023.08.16~2024.04.15)/[Algorithm] Programmers ver.Java2024. 1. 29. 12:29프로그래머스 Lv.0 1로 만들기
class Solution { public int solution(int[] num_list) { int answer = 0; for(int i = 0; i < num_list.length; i++) { while(num_list[i] != 1) { answer++; if(num_list[i] % 2 == 0) { num_list[i] = num_list[i] / 2; } else { num_list[i] = (num_list[i] -1) / 2; } } } return answer; } }