【leetcode 每日打卡】6037. 按奇偶性交换后的最大数字

class Solution:
    def largestInteger(self, num: int) -> int:
        odd = []
        even = []
        for i in str(num):
            if(int(i)%2 == 0):
                odd.append(i)
            else:
                even.append(i)
        odd.sort()
        even.sort()
        ret = ""
        for i in str(num):
            if(int(i)%2 == 0):
                ret = ret+odd.pop()
            else:
                ret = ret+even.pop()
        return int(ret)

1、将奇数和偶数分别提取出来，放入奇数偶数数组
2、再将奇数偶数按原定位置放回，用字符串拼接