add 1342

fishercoder1534 · fishercoder1534 · commit 904842176dae · 2020-02-08T09:50:41.000-08:00
diff --git a/README.md b/README.md
@@ -9,6 +9,7 @@ _If you like this project, please leave me a star._ &#9733;
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
 |1343|[Maximum Product of Splitted Binary Tree](https://leetcode.com/problems/maximum-product-of-splitted-binary-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1343.java) | |Medium||
+|1342|[Number of Steps to Reduce a Number to Zero](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1342.java) | |Easy|Bit Manipulation|
 |1341|[The K Weakest Rows in a Matrix](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1341.java) | |Easy||
 |1338|[Reduce Array Size to The Half](https://leetcode.com/problems/reduce-array-size-to-the-half/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1338.java) | |Medium||
 |1337|[Remove Palindromic Subsequences](https://leetcode.com/problems/remove-palindromic-subsequences/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1337.java) | |Easy|String|
diff --git a/src/main/java/com/fishercoder/solutions/_1342.java b/src/main/java/com/fishercoder/solutions/_1342.java
@@ -0,0 +1,51 @@
+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) {
+            int steps = 0;
+            while (num != 0) {
+                if (num % 2 == 0) {
+                    num /= 2;
+                } else {
+                    num--;
+                }
+                steps++;
+            }
+            return steps;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1342Test.java b/src/test/java/com/fishercoder/_1342Test.java
@@ -0,0 +1,32 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1342;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1342Test {
+    private static _1342.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1342.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(12, solution1.numberOfSteps(123));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(6, solution1.numberOfSteps(14));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(4, solution1.numberOfSteps(8));
+    }
+
+}
