1323

#version 1, 1 line
class Solution:
    def maximum69Number (self, num: int) -> int:
        return str(num).replace('6','9',1)
 
#version 2, from others work in leetcode
class Solution:
    def maximum69Number (self, num: int) -> int:
        str_num = str(num)
        if '6' in str_num:
            pos = str_num.index('6')
            list_num = list(str_num)
            list_num[pos] = '9'
            str_num = ''.join(list_num)
            return int(str_num)
        else:
            return num
 
#version 3, from others work in leetcode
class Solution:
    def maximum69Number (self, num: int) -> int:
        s = str(num)
        lst = []
        for i in s:
            lst.append(i)
        for i in range(len(lst)):
            if lst[i] == '6':
                lst[i] = '9'
                break
        s = ''.join(lst)
        return int(s)
 
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值