JAVA_LeetCode 1342_Number of Steps to Reduce a Number to Zero

JAVA_LeetCode 1342_Number of Steps to Reduce a Number to Zero 풀이 class Solution { public int numberOfSteps(int num) { int cnt = 0; while (num > 0) { num = num % 2 == 0 ? num / 2 : num - 1; cnt++; } return cnt; } } * 출처 https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/...

JAVA_LeetCode 1342_Number of Steps to Reduce a Number to Zero에 대한 요약내용입니다.

자세한 내용은 아래에 원문링크를 확인해주시기 바랍니다.

원문링크 : JAVA_LeetCode 1342_Number of Steps to Reduce a Number to Zero