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;
        }
    }
}

package com.fishercoder.solutions;

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;
        }
    }
}

refactor 1085