feat: add solutions to lc problem: No.1558

No.1558.Minimum Numbers of Function Calls to Make Target Array

Author: yanglbme

.nojekyll

@@ -1 +0,0 @@
-

solution/0600-0699/0676.Implement Magic Dictionary/Solution.py

@@ -1,12 +1,11 @@
 class MagicDictionary:
-
     def __init__(self):
         """
         Initialize your data structure here.
         """
 
     def gen(self, word):
-        return [word[:i] + '*' + word[i + 1:] for i in range(len(word))]
+        return [word[:i] + '*' + word[i + 1 :] for i in range(len(word))]
 
     def buildDict(self, dictionary: List[str]) -> None:
         self.s = set(dictionary)

solution/1500-1599/1558.Minimum Numbers of Function Calls to Make Target Array/README.md

@@ -79,15 +79,77 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def minOperations(self, nums: List[int]) -> int:
+        return sum(v.bit_count() for v in nums) + max(0, max(nums).bit_length() - 1)
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int minOperations(int[] nums) {
+        int ans = 0;
+        int mx = 0;
+        for (int v : nums) {
+            mx = Math.max(mx, v);
+            ans += Integer.bitCount(v);
+        }
+        ans += Integer.toBinaryString(mx).length() - 1;
+        return ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int minOperations(vector<int>& nums) {
+        int ans = 0;
+        int mx = 0;
+        for (int v : nums)
+        {
+            mx = max(mx, v);
+            ans += __builtin_popcount(v);
+        }
+        if (mx) ans += 31 - __builtin_clz(mx);
+        return ans;
+    }
+};
+```
 
+### **Go**
+
+```go
+func minOperations(nums []int) int {
+	ans, mx := 0, 0
+	for _, v := range nums {
+		mx = max(mx, v)
+		for v > 0 {
+			ans += v & 1
+			v >>= 1
+		}
+	}
+	if mx > 0 {
+		for mx > 0 {
+			ans++
+			mx >>= 1
+		}
+		ans--
+	}
+	return ans
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
 ```
 
 ### **...**

solution/1500-1599/1558.Minimum Numbers of Function Calls to Make Target Array/README_EN.md

@@ -57,13 +57,75 @@ Total of operations: 2 + 1 = 3.
 ### **Python3**
 
 ```python
-
+class Solution:
+    def minOperations(self, nums: List[int]) -> int:
+        return sum(v.bit_count() for v in nums) + max(0, max(nums).bit_length() - 1)
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int minOperations(int[] nums) {
+        int ans = 0;
+        int mx = 0;
+        for (int v : nums) {
+            mx = Math.max(mx, v);
+            ans += Integer.bitCount(v);
+        }
+        ans += Integer.toBinaryString(mx).length() - 1;
+        return ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int minOperations(vector<int>& nums) {
+        int ans = 0;
+        int mx = 0;
+        for (int v : nums)
+        {
+            mx = max(mx, v);
+            ans += __builtin_popcount(v);
+        }
+        if (mx) ans += 31 - __builtin_clz(mx);
+        return ans;
+    }
+};
+```
 
+### **Go**
+
+```go
+func minOperations(nums []int) int {
+	ans, mx := 0, 0
+	for _, v := range nums {
+		mx = max(mx, v)
+		for v > 0 {
+			ans += v & 1
+			v >>= 1
+		}
+	}
+	if mx > 0 {
+		for mx > 0 {
+			ans++
+			mx >>= 1
+		}
+		ans--
+	}
+	return ans
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
 ```
 
 ### **...**

solution/1500-1599/1558.Minimum Numbers of Function Calls to Make Target Array/Solution.cpp

@@ -0,0 +1,14 @@
+class Solution {
+public:
+    int minOperations(vector<int>& nums) {
+        int ans = 0;
+        int mx = 0;
+        for (int v : nums)
+        {
+            mx = max(mx, v);
+            ans += __builtin_popcount(v);
+        }
+        if (mx) ans += 31 - __builtin_clz(mx);
+        return ans;
+    }
+};

solution/1500-1599/1558.Minimum Numbers of Function Calls to Make Target Array/Solution.go

@@ -0,0 +1,25 @@
+func minOperations(nums []int) int {
+	ans, mx := 0, 0
+	for _, v := range nums {
+		mx = max(mx, v)
+		for v > 0 {
+			ans += v & 1
+			v >>= 1
+		}
+	}
+	if mx > 0 {
+		for mx > 0 {
+			ans++
+			mx >>= 1
+		}
+		ans--
+	}
+	return ans
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}

solution/1500-1599/1558.Minimum Numbers of Function Calls to Make Target Array/Solution.java

@@ -0,0 +1,12 @@
+class Solution {
+    public int minOperations(int[] nums) {
+        int ans = 0;
+        int mx = 0;
+        for (int v : nums) {
+            mx = Math.max(mx, v);
+            ans += Integer.bitCount(v);
+        }
+        ans += Integer.toBinaryString(mx).length() - 1;
+        return ans;
+    }
+}

solution/1500-1599/1558.Minimum Numbers of Function Calls to Make Target Array/Solution.py

@@ -0,0 +1,3 @@
+class Solution:
+    def minOperations(self, nums: List[int]) -> int:
+        return sum(v.bit_count() for v in nums) + max(0, max(nums).bit_length() - 1)

solution/2300-2399/2332.The Latest Time to Catch a Bus/Solution.py

@@ -1,5 +1,7 @@
 class Solution:
-    def latestTimeCatchTheBus(self, buses: List[int], passengers: List[int], capacity: int) -> int:
+    def latestTimeCatchTheBus(
+        self, buses: List[int], passengers: List[int], capacity: int
+    ) -> int:
         buses.sort()
         passengers.sort()
         j = 0