Minimum Element After Replacement With Digit Sum
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```java []
class Solution {
    public int minElement(int[] nums) {
     int min = Integer.MAX_VALUE;
     for(int i=0; i<nums.length; i++) {
        int num = nums[i];
        int r = 0;
        while(num != 0) {
            int d = num%10;
            r += d;
            num /= 10;
        }
        if(r < min)
        min = r;
     }
     return min ;  
    }
}
```
['Java']