From 3e100def07ba5d0626a6debbae4df320ffe56848 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Jos=C3=A9=20Antonio=20Chac=C3=B3n=20Guti=C3=A9rrez?= <138903866+joseantoniochacon@users.noreply.github.com> Date: Sat, 1 Jun 2024 12:52:50 -0600 Subject: [PATCH] Create README - LeetHub --- .../README.md | 42 +++++++++++++++++++ 1 file changed, 42 insertions(+) create mode 100644 1342-number-of-steps-to-reduce-a-number-to-zero/README.md diff --git a/1342-number-of-steps-to-reduce-a-number-to-zero/README.md b/1342-number-of-steps-to-reduce-a-number-to-zero/README.md new file mode 100644 index 0000000..2feccce --- /dev/null +++ b/1342-number-of-steps-to-reduce-a-number-to-zero/README.md @@ -0,0 +1,42 @@ +

1342. Number of Steps to Reduce a Number to Zero

Easy

Given an integer num, return the number of steps to reduce it to zero.

+ +

In one step, 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:

+ + +
\ No newline at end of file