EasyNo. 1323
Maximum 69 Number — LeetCode 1323 Python Solution
- Pattern
- Greedy
- Topics
- Greedy, Math
- Reading time
- 2 min
- Source
- leetcode.com
The problem
You 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
- Input
- num = 9669
- Output
- 9969
- Explanation
- Changing the first digit results in 6669.
Python solution
class Solution:
def maximum69Number(self, num: int) -> int:
return int(str(num).replace("6", "9", 1))Complexity
- Time
- O(n log n)
- Space · auxiliary
- O(1) to O(n)
Pattern: Greedy
Take the locally best option every time — when you can prove that never costs you later. LeetCode 1323. Maximum 69 Number is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Greedy.
The greedy guide has the Python template for the pattern and the 346 LeetCode problems that use it.
Related problems
| No. | Problem | Difficulty |
|---|---|---|
| 1330 | Reverse Subarray To Maximize Array Value | Hard |
| 0670 | Maximum Swap | Medium |
| 0738 | Monotone Increasing Digits | Medium |
| 0910 | Smallest Range II | Medium |
| 0976 | Largest Perimeter Triangle | Easy |
| 0991 | Broken Calculator | Medium |
Frequently asked questions
- How hard is LeetCode 1323. Maximum 69 Number?
LeetCode 1323. Maximum 69 Number is rated Easy on LeetCode.
- What topics does LeetCode 1323. Maximum 69 Number cover?
LeetCode 1323. Maximum 69 Number is tagged Greedy and Math on LeetCode.