add 1342

Author: luliyucoordinate

README.md

@@ -635,4 +635,5 @@ LeetCode
 |1337|[The K Weakest Rows in a Matrix](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/)|c|[c++](./src/1337-The-K-Weakest-Rows-in-a-Matrix/1337.cpp)|[python](./src/1337-The-K-Weakest-Rows-in-a-Matrix/1337.py)|[go](./src/1337-The-K-Weakest-Rows-in-a-Matrix/1337.go)|[js](./src/1337-The-K-Weakest-Rows-in-a-Matrix/1337.js)|[java](./src/1337-The-K-Weakest-Rows-in-a-Matrix/1337.java)|Easy|
 |1338|[Reduce Array Size to The Half](https://leetcode.com/problems/reduce-array-size-to-the-half/)|c|[c++](./src/1338-Reduce-Array-Size-to-The-Half/1338.cpp)|[python](./src/1338-Reduce-Array-Size-to-The-Half/1338.py)|[go](./src/1338-Reduce-Array-Size-to-The-Half/1338.go)|[js](./src/1338-Reduce-Array-Size-to-The-Half/1338.js)|[java](./src/1338-Reduce-Array-Size-to-The-Half/1338.java)|Medium|
 |1339|[Maximum Product of Splitted Binary Tree](https://leetcode.com/problems/maximum-product-of-splitted-binary-tree/)|c|[c++](./src/1339-Maximum-Product-of-Splitted-Binary-Tree/1339.cpp)|[python](./src/1339-Maximum-Product-of-Splitted-Binary-Tree/1339.py)|[go](./src/1339-Maximum-Product-of-Splitted-Binary-Tree/1339.go)|[js](./src/1339-Maximum-Product-of-Splitted-Binary-Tree/1339.js)|[java](./src/1339-Maximum-Product-of-Splitted-Binary-Tree/1339.java)|Medium|
-|1340|[Jump Game V](https://leetcode.com/problems/jump-game-v/)|c|[c++](./src/1340-Jump-Game-V/1340.cpp)|[python](./src/1340-Jump-Game-V/1340.py)|[go](./src/1340-Jump-Game-V/1340.go)|[js](./src/1340-Jump-Game-V/1340.js)|[java](./src/1340-Jump-Game-V/1340.java)|Hard|
+|1340|[Jump Game V](https://leetcode.com/problems/jump-game-v/)|c|[c++](./src/1340-Jump-Game-V/1340.cpp)|[python](./src/1340-Jump-Game-V/1340.py)|[go](./src/1340-Jump-Game-V/1340.go)|[js](./src/1340-Jump-Game-V/1340.js)|[java](./src/1340-Jump-Game-V/1340.java)|Hard|
+|1342|[Number of Steps to Reduce a Number to Zero](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/)|c|[c++](./src/1342-Number-of-Steps-to-Reduce-a-Number-to-Zero/1342.cpp)|[python](./src/1342-Number-of-Steps-to-Reduce-a-Number-to-Zero/1342.py)|[go](./src/1342-Number-of-Steps-to-Reduce-a-Number-to-Zero/1342.go)|[js](./src/1342-Number-of-Steps-to-Reduce-a-Number-to-Zero/1342.js)|[java](./src/1342-Number-of-Steps-to-Reduce-a-Number-to-Zero/1342.java)|Easy|

src/1342-Number-of-Steps-to-Reduce-a-Number-to-Zero/1342.cpp

@@ -0,0 +1,8 @@
+class Solution 
+{
+public:
+    int numberOfSteps (int num) 
+    {
+        return num == 0 ? 0 : 1 + numberOfSteps(num & 1 ? num - 1 : num >> 1);
+    }
+};

src/1342-Number-of-Steps-to-Reduce-a-Number-to-Zero/1342.go

@@ -0,0 +1,5 @@
+class Solution {
+    public int numberOfSteps (int num) {
+        return num == 0 ? 0 : 1 + numberOfSteps(num % 2 == 1 ? num - 1 : num >> 1);
+    }
+}

src/1342-Number-of-Steps-to-Reduce-a-Number-to-Zero/1342.java

@@ -0,0 +1,3 @@
+var numberOfSteps = function(num) {
+    return num == 0 ? 0 : 1 + numberOfSteps(num & 1 ? num - 1 : num >> 1);
+};

src/1342-Number-of-Steps-to-Reduce-a-Number-to-Zero/1342.js

@@ -0,0 +1,3 @@
+class Solution:
+    def numberOfSteps (self, num: int) -> int:
+        return 0 if not num else 1 + self.numberOfSteps(num >> 1 if num % 2 == 0 else num - 1)

src/1342-Number-of-Steps-to-Reduce-a-Number-to-Zero/1342.py

@@ -2,10 +2,10 @@
 import os, bisect
 
 # 题目名称
-name = "Partition Equal Subset Sum"
-ID = 416
-url = "https://leetcode.com/problems/partition-equal-subset-sum/"
-difficult = "Medium"
+name = "Number of Steps to Reduce a Number to Zero"
+ID = 1342
+url = "https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/"
+difficult = "Easy"
 prog = ['c', 'cpp', 'py', 'go', 'js', 'java']