feat: add solutions to lc problem: No.2160

No.2160.Minimum Sum of Four Digit Number After Splitting Digits

Author: yanglbme

solution/1100-1199/1189.Maximum Number of Balloons/README.md

@@ -58,11 +58,10 @@
 ```python
 class Solution:
     def maxNumberOfBalloons(self, text: str) -> int:
-        ans = 0
         counter = Counter(text)
         counter['l'] >>= 1
         counter['o'] >>= 1
-        return min(counter['b'], counter['a'], counter['l'], counter['o'], counter['n'])
+        return min(counter[c] for c in 'balon')
 ```
 
 ### **Java**

solution/1100-1199/1189.Maximum Number of Balloons/README_EN.md

@@ -51,11 +51,10 @@
 ```python
 class Solution:
     def maxNumberOfBalloons(self, text: str) -> int:
-        ans = 0
         counter = Counter(text)
         counter['l'] >>= 1
         counter['o'] >>= 1
-        return min(counter['b'], counter['a'], counter['l'], counter['o'], counter['n'])
+        return min(counter[c] for c in 'balon')
 ```
 
 ### **Java**

solution/1100-1199/1189.Maximum Number of Balloons/Solution.py

@@ -1,7 +1,6 @@
 class Solution:
     def maxNumberOfBalloons(self, text: str) -> int:
-        ans = 0
         counter = Counter(text)
         counter['l'] >>= 1
         counter['o'] >>= 1
-        return min(counter['b'], counter['a'], counter['l'], counter['o'], counter['n'])
+        return min(counter[c] for c in 'balon')

solution/2100-2199/2160.Minimum Sum of Four Digit Number After Splitting Digits/README.md

@@ -51,15 +51,64 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def minimumSum(self, num: int) -> int:
+        nums = []
+        while num:
+            nums.append(num % 10)
+            num //= 10
+        nums.sort()
+        return 10 * (nums[0] + nums[1]) + nums[2] + nums[3]
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int minimumSum(int num) {
+        int[] nums = new int[4];
+        for (int i = 0; num != 0; ++i) {
+            nums[i] = num % 10;
+            num /= 10;
+        }
+        Arrays.sort(nums);
+        return 10 * (nums[0] + nums[1]) + nums[2] + nums[3];
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int minimumSum(int num) {
+        vector<int> nums;
+        while (num)
+        {
+            nums.push_back(num % 10);
+            num /= 10;
+        }
+        sort(nums.begin(), nums.end());
+        return 10 * (nums[0] + nums[1]) + nums[2] + nums[3];
+    }
+};
+```
 
+### **Go**
+
+```go
+func minimumSum(num int) int {
+	var nums []int
+	for num > 0 {
+		nums = append(nums, num%10)
+		num /= 10
+	}
+	sort.Ints(nums)
+	return 10*(nums[0]+nums[1]) + nums[2] + nums[3]
+}
 ```
 
 ### **TypeScript**

solution/2100-2199/2160.Minimum Sum of Four Digit Number After Splitting Digits/README_EN.md

@@ -45,13 +45,62 @@ The minimum sum can be obtained by the pair [4, 9]: 4 + 9 = 13.
 ### **Python3**
 
 ```python
-
+class Solution:
+    def minimumSum(self, num: int) -> int:
+        nums = []
+        while num:
+            nums.append(num % 10)
+            num //= 10
+        nums.sort()
+        return 10 * (nums[0] + nums[1]) + nums[2] + nums[3]
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int minimumSum(int num) {
+        int[] nums = new int[4];
+        for (int i = 0; num != 0; ++i) {
+            nums[i] = num % 10;
+            num /= 10;
+        }
+        Arrays.sort(nums);
+        return 10 * (nums[0] + nums[1]) + nums[2] + nums[3];
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int minimumSum(int num) {
+        vector<int> nums;
+        while (num)
+        {
+            nums.push_back(num % 10);
+            num /= 10;
+        }
+        sort(nums.begin(), nums.end());
+        return 10 * (nums[0] + nums[1]) + nums[2] + nums[3];
+    }
+};
+```
 
+### **Go**
+
+```go
+func minimumSum(num int) int {
+	var nums []int
+	for num > 0 {
+		nums = append(nums, num%10)
+		num /= 10
+	}
+	sort.Ints(nums)
+	return 10*(nums[0]+nums[1]) + nums[2] + nums[3]
+}
 ```
 
 ### **TypeScript**

solution/2100-2199/2160.Minimum Sum of Four Digit Number After Splitting Digits/Solution.cpp

@@ -0,0 +1,13 @@
+class Solution {
+public:
+    int minimumSum(int num) {
+        vector<int> nums;
+        while (num)
+        {
+            nums.push_back(num % 10);
+            num /= 10;
+        }
+        sort(nums.begin(), nums.end());
+        return 10 * (nums[0] + nums[1]) + nums[2] + nums[3];
+    }
+};

solution/2100-2199/2160.Minimum Sum of Four Digit Number After Splitting Digits/Solution.go

@@ -0,0 +1,9 @@
+func minimumSum(num int) int {
+	var nums []int
+	for num > 0 {
+		nums = append(nums, num%10)
+		num /= 10
+	}
+	sort.Ints(nums)
+	return 10*(nums[0]+nums[1]) + nums[2] + nums[3]
+}

solution/2100-2199/2160.Minimum Sum of Four Digit Number After Splitting Digits/Solution.java

@@ -0,0 +1,11 @@
+class Solution {
+    public int minimumSum(int num) {
+        int[] nums = new int[4];
+        for (int i = 0; num != 0; ++i) {
+            nums[i] = num % 10;
+            num /= 10;
+        }
+        Arrays.sort(nums);
+        return 10 * (nums[0] + nums[1]) + nums[2] + nums[3];
+    }
+}

solution/2100-2199/2160.Minimum Sum of Four Digit Number After Splitting Digits/Solution.py

@@ -0,0 +1,8 @@
+class Solution:
+    def minimumSum(self, num: int) -> int:
+        nums = []
+        while num:
+            nums.append(num % 10)
+            num //= 10
+        nums.sort()
+        return 10 * (nums[0] + nums[1]) + nums[2] + nums[3]