Skip to content

Commit 19a314c

Browse files
solves number of steps to reduce a nuimber to zero
1 parent 82ea40b commit 19a314c

File tree

2 files changed

+14
-3
lines changed

2 files changed

+14
-3
lines changed

README.md

+3-3
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
# LeetCode Algorithms
22

3-
![problems-solved](https://img.shields.io/badge/Problems%20Solved-266/2081-1f425f.svg)
4-
![problems-solved-java](https://img.shields.io/badge/Java-266/2081-1abc9c.svg)
3+
![problems-solved](https://img.shields.io/badge/Problems%20Solved-273/2081-1f425f.svg)
4+
![problems-solved-java](https://img.shields.io/badge/Java-273/2081-1abc9c.svg)
55
![problems-solved-python](https://img.shields.io/badge/Python-186/2081-1abc9c.svg)
66
[![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen.svg)](CONTRIBUTING.md)
77
[![cp](https://img.shields.io/badge/also%20see-Competitve%20Programming-1f72ff.svg)](https://github.com/anishLearnsToCode/competitive-programming)
@@ -343,7 +343,7 @@
343343
| 1331 | [Rank Transform of An Array](https://leetcode.com/problems/rank-transform-of-an-array) | [![Java](assets/java.png)](src/RankTransformOfArray.java) | |
344344
| 1332 | [Remove Palindromic Subsequences](https://leetcode.com/problems/remove-palindromic-subsequences) | [![Java](assets/java.png)](src/RemovePalindromicSubSequences.java) | |
345345
| 1337 | [The K Weakest Rows In A Matrix](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix) | [![Java](assets/java.png)](src/TheKWeakestRowsInAMatrix.java) | |
346-
| 1342 | [Number of Steps to Reduce a Number to Zero](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero) | | |
346+
| 1342 | [Number of Steps to Reduce a Number to Zero](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero) | [![Java](assets/java.png)](src/NumberOfStepsToReduceANumberToZero.java) | |
347347
| 1346 | [Check if N and It's Double Exist](https://leetcode.com/problems/check-if-n-and-its-double-exist) | | |
348348
| 1351 | [Count Negative Numbers In A Sorted Matrix](https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix) | | |
349349
| 1356 | [Sort Integers by Number of 1 Bits](https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits) | | |
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
public class NumberOfStepsToReduceANumberToZero {
2+
public int numberOfSteps(int num) {
3+
int steps = 0;
4+
while (num > 0) {
5+
steps++;
6+
if ((num & 1) == 0) num >>= 1;
7+
else num -= 1;
8+
}
9+
return steps;
10+
}
11+
}

0 commit comments

Comments
 (0)