Sum of Digits in the Minimum Number
给一个数组, 求其中最小数字的每一位数的和的奇偶.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 |
class Solution { public: int count(int n) { int res = 0; while(n != 0) { res = res + (n % 10); n = n / 10; } return res; } int sumOfDigits(vector<int>& A) { int min = A[0]; for(int i = 1; i < A.size(); i++) { if(A[i] < min) { min = A[i]; } } if(count(min) % 2 == 0) { return 1; } else { return 0; } } }; |