LeetCode 솔루션 분류
[11/7] 1323. Maximum 69 Number
본문
Easy
2104182Add to ListShareYou are given a positive integer num consisting only of digits 6 and 9.
Return the maximum number you can get by changing at most one digit (6 becomes 9, and 9 becomes 6).
Example 1:
Input: num = 9669 Output: 9969 Explanation: Changing the first digit results in 6669. Changing the second digit results in 9969. Changing the third digit results in 9699. Changing the fourth digit results in 9666. The maximum number is 9969.
Example 2:
Input: num = 9996 Output: 9999 Explanation: Changing the last digit 6 to 9 results in the maximum number.
Example 3:
Input: num = 9999 Output: 9999 Explanation: It is better not to apply any change.
Constraints:
1 <= num <= 104numconsists of only6and9digits.
Accepted
183,911
Submissions
224,419
태그
#HRT
관련자료
-
링크
댓글 2
학부유학생님의 댓글
- 익명
- 작성일
Runtime: 64 ms, faster than 17.68% of Python3 online submissions for Maximum 69 Number.
Memory Usage: 13.7 MB, less than 95.47% of Python3 online submissions for Maximum 69 Number.
Memory Usage: 13.7 MB, less than 95.47% of Python3 online submissions for Maximum 69 Number.
class Solution:
def maximum69Number (self, num: int) -> int:
num = list(str(num))
for idx, char in enumerate(num):
if char == "6":
num[idx] = "9"
break
return int("".join(num))
