1085. Sum of Digits in the Minimum Number
Tags: ‘Array’
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 <= 1001 <= A[i].length <= 100
Solution
public int sumOfDigits(int[] A) {
int min = Integer.MAX_VALUE;
for (int i: A) {
if (i < min) min = i;
}
int sum = 0;
char[] array = String.valueOf(min).toCharArray();
for (char c: array) {
sum += Integer.valueOf(c);
}
int result = 0;
if ((sum % 2) == 0) result = 1;
return result;
}