Easy solution beats 98% 💀🔥🔥🔥📝📝
Approach\n Describe your approach to solving the problem. \nVery easy problem. The only "challenge" is to find the digits which can be done easily by the algori
# Approach\n<!-- Describe your approach to solving the problem. -->\nVery easy problem. The only "challenge" is to find the digits which can be done easily by the algorithm bellow. \n\n# Code\n```python []\nclass Solution(object):\n    def minElement(self, nums):\n        """\n        :type nums: List[int]\n        :rtype: int\n        """\n        length = len(nums)\n        for i in range(length):\n            num = nums[i]\n            sum = 0\n            while num > 0:\n                mod = num % 10\n                num = num // 10\n                sum += mod\n            nums[i] = sum\n        return min(nums)\n```
['Python']