Java Clean Simple Solution
Complexity\n- Time complexity:O(n*X)\n Add your time complexity here, e.g. O(n) \n\n- Space complexity:O(1)\n Add your space complexity here, e.g. O(n) \n\n# Co
# Complexity\n- Time complexity:$$O(n*X)$$\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:$$O(1)$$\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```java []\nclass Solution {\n    \n    private int getSumDigits(int num){\n        int sum = 0;\n        while(num != 0){\n            sum += num%10;\n            num/=10;\n        }\n        return sum;\n    }\n    \n    public int minElement(int[] nums) {\n        int res=Integer.MAX_VALUE;\n        for(int num:nums){\n            res = Math.min(res, getSumDigits(num));\n        }\n        return res;\n    }\n}\n```
['Math', 'Enumeration', 'Number Theory', 'Java']