add 1085

Author: fishercoder1534

README.md

@@ -44,6 +44,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |1170|[Compare Strings by Frequency of the Smallest Character](https://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1170.java) | | | |Easy||
 |1119|[Remove Vowels from a String](https://leetcode.com/problems/remove-vowels-from-a-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1119.java) | | | [:tv:](https://www.youtube.com/watch?v=6KCBrIWEauw)|Easy||
 |1089|[Duplicate Zeros](https://leetcode.com/problems/duplicate-zeros/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1089.java) | O(n^2) | O(1) | |Easy||
+|1085|[Sum of Digits in the Minimum Number](https://leetcode.com/problems/sum-of-digits-in-the-minimum-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1085.java) | | | |Easy||
 |1079|[Letter Tile Possibilities](https://leetcode.com/problems/letter-tile-possibilities/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1079.java) | O(1) | O(1) | |Medium||
 |1078|[Occurrences After Bigram](https://leetcode.com/problems/occurrences-after-bigram/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1078.java) | O(n) | O(1) | |Easy||
 |1071|[Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1071.java) | O(m*n) | O(1) | |Easy||

src/main/java/com/fishercoder/solutions/_1085.java

@@ -0,0 +1,40 @@
+package com.fishercoder.solutions;
+
+/**
+ * 1085. Sum of Digits in the Minimum Number
+ *
+ * Given an array A of positive integers, let S be the sum of the digits of the minimal element of A.
+ * Return 0 if S is odd, otherwise return 1.
+ *
+ * Example 1:
+ * Input: [34,23,1,24,75,33,54,8]
+ * Output: 0
+ * Explanation:
+ * The minimal element is 1, and the sum of those digits is S = 1 which is odd, so the answer is 0.
+ *
+ * Example 2:
+ * Input: [99,77,33,66,55]
+ * Output: 1
+ * Explanation:
+ * The minimal element is 33, and the sum of those digits is S = 3 + 3 = 6 which is even, so the answer is 1.
+ *
+ * Note:
+ * 1 <= A.length <= 100
+ * 1 <= A[i].length <= 100
+ * */
+public class _1085 {
+    public static class Solution1 {
+        public int sumOfDigits(int[] A) {
+            int smallestNumber = A[0];
+            for (int i = 1; i < A.length; i++) {
+                smallestNumber = Math.min(smallestNumber, A[i]);
+            }
+            int sum = 0;
+            while (smallestNumber > 0) {
+                sum += smallestNumber % 10;
+                smallestNumber /= 10;
+            }
+            return sum % 2 == 0 ? 1 : 0;
+        }
+    }
+}

src/test/java/com/fishercoder/_1085Test.java

@@ -0,0 +1,26 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1085;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1085Test {
+    private static _1085.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1085.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(0, solution1.sumOfDigits(new int[]{34, 23, 1, 24, 75, 33, 54, 8}));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(1, solution1.sumOfDigits(new int[]{99, 77, 33, 66, 55}));
+    }
+}