LeetCode知识点总结 - 2259

LeetCode 2259. Remove Digit From Number to Maximize Result

考点	难度
Greedy	Easy

题目

You are given a string number representing a positive integer and a character digit.

Return the resulting string after removing exactly one occurrence of digit from number such that the value of the resulting string in decimal form is maximized. The test cases are generated such that digit occurs at least once in number.

思路

先找到digit的位置i。如果i+1位置上的数小于digit，跳过，找下一个digit出现的位置，否则return。如果iterate完number还是没有return，remove最后一次出现的digit。

答案

class Solution(object):
    def removeDigit(self, number, digit):
        last_index = 0
        for num in range(1, len(number)):
            
            if number[num-1] == digit:
                if int(number[num]) > int(number[num-1]):
                    return number[:num-1] + number[num:]
                else:
                    last_index = num - 1
        
        if number[-1] == digit:
            last_index = len(number) - 1

        return number[:last_index] + number[last_index + 1:]