728x90
https://leetcode.com/problems/remove-digit-from-number-to-maximize-result/description/
Remove Digit From Number to Maximize Result - LeetCode
Can you solve this real interview question? Remove Digit From Number to Maximize Result - 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 n
leetcode.com
숫자 문자열에서 주어진 수 하나를 지웠을 때 가장 크게 만드는 값
가장 앞에 있는 값을 삭제하고
끝까지 갔을 때 정답이 없다면 가장 뒤의 값을 삭제한다
class Solution:
def removeDigit(self, number: str, digit: str) -> str:
for n,i in enumerate(number):
if i==digit:
if len(number)-1<=n:
return number[:-1]
else:
if i<number[n+1]:
return number[:n]+number[n+1:]
a=number.rindex(digit)
return number[:a]+number[a+1:]
'알고리즘 > leetcode' 카테고리의 다른 글
2260. Minimum Consecutive Cards to Pick Up (1) | 2023.05.26 |
---|---|
347. Top K Frequent Elements (0) | 2023.05.25 |
24. Swap Nodes in Pairs - python (0) | 2023.05.19 |
1721. Swapping Nodes in a Linked List - python (0) | 2023.05.16 |
59. Spiral Matrix II - python (0) | 2023.05.10 |
댓글