add 1404

Author: luliyucoordinate

README.md

@@ -700,4 +700,5 @@ LeetCode
 |1400|[Construct K Palindrome Strings](https://leetcode.com/problems/construct-k-palindrome-strings/)|c|[c++](./src/1400-Construct-K-Palindrome-Strings/1400.cpp)|[python](./src/1400-Construct-K-Palindrome-Strings/1400.py)|[go](./src/1400-Construct-K-Palindrome-Strings/1400.go)|[js](./src/1400-Construct-K-Palindrome-Strings/1400.js)|[java](./src/1400-Construct-K-Palindrome-Strings/1400.java)|Medium|
 |1401|[Circle and Rectangle Overlapping](https://leetcode.com/problems/circle-and-rectangle-overlapping/)|c|[c++](./src/1401-Circle-and-Rectangle-Overlapping/1401.cpp)|[python](./src/1401-Circle-and-Rectangle-Overlapping/1401.py)|[go](./src/1401-Circle-and-Rectangle-Overlapping/1401.go)|[js](./src/1401-Circle-and-Rectangle-Overlapping/1401.js)|[java](./src/1401-Circle-and-Rectangle-Overlapping/1401.java)|Medium|
 |1402|[Reducing Dishes](https://leetcode.com/problems/reducing-dishes/)|c|[c++](./src/1402-Reducing-Dishes/1402.cpp)|[python](./src/1402-Reducing-Dishes/1402.py)|[go](./src/1402-Reducing-Dishes/1402.go)|[js](./src/1402-Reducing-Dishes/1402.js)|[java](./src/1402-Reducing-Dishes/1402.java)|Hard|
-|1403|[Minimum Subsequence in Non-Increasing Order](https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order/)|c|[c++](./src/1403-Minimum-Subsequence-in-Non-Increasing-Order/1403.cpp)|[python](./src/1403-Minimum-Subsequence-in-Non-Increasing-Order/1403.py)|[go](./src/1403-Minimum-Subsequence-in-Non-Increasing-Order/1403.go)|[js](./src/1403-Minimum-Subsequence-in-Non-Increasing-Order/1403.js)|[java](./src/1403-Minimum-Subsequence-in-Non-Increasing-Order/1403.java)|Easy|
+|1403|[Minimum Subsequence in Non-Increasing Order](https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order/)|c|[c++](./src/1403-Minimum-Subsequence-in-Non-Increasing-Order/1403.cpp)|[python](./src/1403-Minimum-Subsequence-in-Non-Increasing-Order/1403.py)|[go](./src/1403-Minimum-Subsequence-in-Non-Increasing-Order/1403.go)|[js](./src/1403-Minimum-Subsequence-in-Non-Increasing-Order/1403.js)|[java](./src/1403-Minimum-Subsequence-in-Non-Increasing-Order/1403.java)|Easy|
+|1404|[Number of Steps to Reduce a Number in Binary Representation to One](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one/)|c|[c++](./src/1404-Number-of-Steps-to-Reduce-a-Number-in-Binary-Representation-to-One/1404.cpp)|[python](./src/1404-Number-of-Steps-to-Reduce-a-Number-in-Binary-Representation-to-One/1404.py)|[go](./src/1404-Number-of-Steps-to-Reduce-a-Number-in-Binary-Representation-to-One/1404.go)|[js](./src/1404-Number-of-Steps-to-Reduce-a-Number-in-Binary-Representation-to-One/1404.js)|[java](./src/1404-Number-of-Steps-to-Reduce-a-Number-in-Binary-Representation-to-One/1404.java)|Medium|

src/1404-Number-of-Steps-to-Reduce-a-Number-in-Binary-Representation-to-One/1404.cpp

@@ -0,0 +1,15 @@
+class Solution {
+public:
+    int numSteps(string s) {
+        int res = 0, add = 0, n = s.size();
+        
+        for (int i = n - 1; i; i--) {
+            res++;
+            if (s[i] - '0' + add == 1) {
+                add = 1;
+                res++;
+            }
+        }
+        return res + add;
+    }
+};

src/1404-Number-of-Steps-to-Reduce-a-Number-in-Binary-Representation-to-One/1404.go

@@ -0,0 +1,12 @@
+func numSteps(s string) int {
+    res, add, n := 0, 0, len(s)
+    
+    for i := n - 1; i > 0; i-- {
+        res++
+        if int(s[i] - '0') + add == 1 {
+            add = 1
+            res++
+        }
+    }
+    return res + add
+}

src/1404-Number-of-Steps-to-Reduce-a-Number-in-Binary-Representation-to-One/1404.java

@@ -0,0 +1,14 @@
+class Solution {
+    public int numSteps(String s) {
+        int res = 0, add = 0, n = s.length();
+        
+        for (int i = n - 1; i > 0; i--) {
+            res++;
+            if (s.charAt(i) - '0' + add == 1) {
+                add = 1;
+                res++;
+            }
+        }
+        return res + add;
+    }
+}

src/1404-Number-of-Steps-to-Reduce-a-Number-in-Binary-Representation-to-One/1404.js

@@ -0,0 +1,12 @@
+var numSteps = function(s) {
+    let res = 0, add = 0, n = s.length;
+        
+    for (let i = n - 1; i > 0; i--) {
+        res++;
+        if (s.charCodeAt(i) - 48 + add == 1) {
+            add = 1;
+            res++;
+        }
+    }
+    return res + add;
+};

src/1404-Number-of-Steps-to-Reduce-a-Number-in-Binary-Representation-to-One/1404.py

@@ -0,0 +1,9 @@
+class Solution:
+    def numSteps(self, s: str) -> int:
+        res, add, n = 0, 0, len(s)
+        for i in range(n - 1, 0, -1):
+            res += 1
+            if (1 if s[i] == '1' else 0) + add == 1: # 当前为奇数，需要加1和移位
+                add = 1
+                res += 1
+        return res + add

src/addProb.py

@@ -2,10 +2,10 @@
 import os, bisect
 
 # 题目名称
-name = "Minimum Subsequence in Non-Increasing Order"
-ID = 1403
-url = "https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order/"
-difficult = "Easy"
+name = "Number of Steps to Reduce a Number in Binary Representation to One"
+ID = 1404
+url = "https://leetcode.com/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one/"
+difficult = "Medium"
 prog = ['c', 'cpp', 'py', 'go', 'js', 'java']