程式語言 - LeetCode - C++ - 3300. Minimum Element After Replacement With Digit Sum



題目:


解答:

class Solution {
public:
    int minElement(vector<int>& nums) {
        int ans = INT_MAX;

        for (int n : nums) {
            int sum = 0;

            while (n > 0) {
                sum += (n % 10);
                n /= 10;
            }

            ans = min(ans, sum);
        }

        return ans;
    }
};