LeetCode/C++/1085.cpp at master · strengthen/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
__________________________________________________________________________________________________
class Solution {
public:
    int sumOfDigits(vector<int>& A) {
        int t=*min_element(A.begin(),A.end());
        int cnt=0;
        while(t>0){
            cnt+=t%10;
            t=t/10;
        }

        if(cnt%2==0) return 1;
        else return 0;
    }
};
__________________________________________________________________________________________________

__________________________________________________________________________________________________