python-algorithm
leetcode 2160. Minimum Sum of Four Digit Number After Splitting Digits
무적김두칠
2022. 3. 7. 10:58
|
1
2
3
4
5
6
7
8
9
10
|
class Solution:
def minimumSum(self, num: int) -> int:
tmp1=''
tmp2=''
numStr=list(str(num))
numStr.sort()
for i in range(len(numStr)):
if i%2==0: tmp1+=numStr[i]
else :tmp2+=numStr[i]
return int(tmp1)+int(tmp2)
|
cs |
반응형