refactor 1342

fishercoder1534 · fishercoder1534 · commit 5a68385303c4 · 2020-09-22T06:19:40.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_1342.java b/src/main/java/com/fishercoder/solutions/_1342.java
@@ -1,38 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 1342. Number of Steps to Reduce a Number to Zero
- *
- * Given a non-negative integer num, return the number of steps to reduce it to zero.
- * If the current number is even, you have to divide it by 2, otherwise, you have to subtract 1 from it.
- *
- * Example 1:
- * Input: num = 14
- * Output: 6
- * Explanation:
- * Step 1) 14 is even; divide by 2 and obtain 7.
- * Step 2) 7 is odd; subtract 1 and obtain 6.
- * Step 3) 6 is even; divide by 2 and obtain 3.
- * Step 4) 3 is odd; subtract 1 and obtain 2.
- * Step 5) 2 is even; divide by 2 and obtain 1.
- * Step 6) 1 is odd; subtract 1 and obtain 0.
- *
- * Example 2:
- * Input: num = 8
- * Output: 4
- * Explanation:
- * Step 1) 8 is even; divide by 2 and obtain 4.
- * Step 2) 4 is even; divide by 2 and obtain 2.
- * Step 3) 2 is even; divide by 2 and obtain 1.
- * Step 4) 1 is odd; subtract 1 and obtain 0.
- *
- * Example 3:
- * Input: num = 123
- * Output: 12
- *
- * Constraints:
- * 0 <= num <= 10^6
- * */
 public class _1342 {
     public static class Solution1 {
         public int numberOfSteps(int num) {
