add 2160

fishercoder1534 · fishercoder1534 · commit 09a30b566002 · 2022-02-05T08:08:08.000-08:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |-----|----------------|---------------|--------|-------------|-------------
+|2160|[Minimum Sum of Four Digit Number After Splitting Digits](https://leetcode.com/problems/minimum-sum-of-four-digit-number-after-splitting-digits/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2160.java) ||Easy||
 |2156|[Find Substring With Given Hash Value](https://leetcode.com/problems/find-substring-with-given-hash-value/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2156.java) ||Medium||
 |2155|[All Divisions With the Highest Score of a Binary Array](https://leetcode.com/problems/all-divisions-with-the-highest-score-of-a-binary-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2155.java) ||Medium||
 |2154|[Keep Multiplying Found Values by Two](https://leetcode.com/problems/keep-multiplying-found-values-by-two/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2154.java) ||Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_2160.java b/src/main/java/com/fishercoder/solutions/_2160.java
@@ -0,0 +1,30 @@
+package com.fishercoder.solutions;
+
+import java.util.Arrays;
+
+public class _2160 {
+    public static class Solution1 {
+        public int minimumSum(int num) {
+            int[] digits = new int[4];
+            int i = 0;
+            while (num != 0) {
+                digits[i++] = num % 10;
+                num /= 10;
+            }
+            Arrays.sort(digits);
+            int num1 = 0;
+            if (digits[0] == 0) {
+                num1 = digits[3];
+            } else {
+                num1 = digits[0] * 10 + digits[3];
+            }
+            int num2 = 0;
+            if (digits[1] == 0) {
+                num2 = digits[2];
+            } else {
+                num2 = digits[1] * 10 + digits[2];
+            }
+            return num1 + num2;
+        }
+    }
+}
