[프로그래머스] [LV1] 콜라츠 추측
업데이트:
📚 콜라츠 추측
링크📎 : https://programmers.co.kr/learn/courses/30/lessons/12943
난이도 ⭐️
📖 문제
📝 내 풀이
class Solution {
public int solution(int num) {
int answer = 0;
long n = (long)num;
while(n != 1 && answer != 500){
if(n % 2 ==0)
n /= 2;
else
n = n * 3 + 1;
answer++;
}
answer = answer == 500 ? -1 : answer;
return answer;
}
}
끝-!
댓글남기기