Leetcode 670. Maximum Swap

文章作者:Tyan
博客:noahsnail.com  |  CSDN  |  简书

1. Description

Maximum Swap

2. Solution

  • Version 1
class Solution:
    def maximumSwap(self, num):
        s = list(str(num))
        length = len(s)
        if length < 2:
            return num

        for i in range(length - 1):
            max_index = i
            for j in range(i + 1, length):
                if s[j] >= s[max_index] and s[i] != s[j]:
                    max_index = j
            if max_index != i:
                temp = s[i]
                s[i] = s[max_index]
                s[max_index] = temp
                break 

        return int(''.join(s))
  • Version 2
class Solution:
    def maximumSwap(self, num):
        s = list(str(num))
        length = len(s)
        if length < 2:
            return num

        pre = 0
        post = 0
        max_index = length - 1
        for i in range(length - 1, -1, -1):
            if s[i] > s[max_index]:
                max_index = i
            elif s[i] < s[max_index]:
                pre = i
                post = max_index


        temp = s[pre]
        s[pre] = s[post]
        s[post] = temp
        

        return int(''.join(s))

Reference

  1. https://leetcode.com/problems/maximum-swap/
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值