3300. Minimum Element After Replacement With Digit Sum

/**
 * Problem: LeetCode 3300 - Minimum Element After Replacement With Digit Sum
 * Difficulty: Easy
 * Language: Java
 * Author: CodeByTushu
 */
class Solution {
    public int minElement(int[] nums) {
        int minVal = Integer.MAX_VALUE;

        for (int num : nums) {
            int sum = 0;
            int temp = num;
            while (temp > 0) {
                sum += temp % 10;
                temp /= 10;
            }
            if (sum < minVal) {
                minVal = sum;
            }
        }

        return minVal;
    }
}

"""
Problem: LeetCode 3300 - Minimum Element After Replacement With Digit Sum
Difficulty: Easy
Language: Python
Author: CodeByTushu
"""
from typing import List

class Solution:
    def minElement(self, nums: List[int]) -> int:
        min_val = float('inf')

        for num in nums:
            digit_sum = 0
            temp = num
            while temp > 0:
                digit_sum += temp % 10
                temp //= 10
            if digit_sum < min_val:
                min_val = digit_sum

        return min_val

/**
 * Problem: LeetCode 3300 - Minimum Element After Replacement With Digit Sum
 * Difficulty: Easy
 * Language: C++
 * Author: CodeByTushu
 */
#include <vector>
#include <algorithm>
#include <climits>

using namespace std;

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

        for (int num : nums) {
            int sum = 0;
            int temp = num;
            while (temp > 0) {
                sum += temp % 10;
                temp /= 10;
            }
            minVal = min(minVal, sum);
        }

        return minVal;
    }
};

/**
 * Problem: LeetCode 3300 - Minimum Element After Replacement With Digit Sum
 * Difficulty: Easy
 * Language: JavaScript
 * Author: CodeByTushu
 */
/**
 * @param {number[]} nums
 * @return {number}
 */
var minElement = function(nums) {
    let minVal = Infinity;

    for (let i = 0; i < nums.length; i++) {
        let sum = 0;
        let temp = nums[i];
        while (temp > 0) {
            sum += temp % 10;
            temp = Math.floor(temp / 10);
        }
        if (sum < minVal) {
            minVal = sum;
        }
    }

    return minVal;
};