|
| 1 | +#!/usr/bin/env python3 |
| 2 | +""" |
| 3 | +CREATED AT: 2022年11月07日 |
| 4 | + |
| 5 | +URL: https://leetcode.com/problems/maximum-69-number/ |
| 6 | + |
| 7 | +GITHUB: https://github.com/Jiezhi/myleetcode |
| 8 | + |
| 9 | +FileName: 1323-Maximum69Number |
| 10 | + |
| 11 | +Difficulty: Easy |
| 12 | + |
| 13 | +Desc: |
| 14 | + |
| 15 | +Tag: |
| 16 | + |
| 17 | +See: |
| 18 | + |
| 19 | +""" |
| 20 | + |
| 21 | + |
| 22 | +class Solution: |
| 23 | + def maximum69Number(self, num: int) -> int: |
| 24 | + """ |
| 25 | + Runtime: 66 ms, faster than 12.89% |
| 26 | + Memory Usage: 13.8 MB, less than 54.69% |
| 27 | + 1 <= num <= 10^4 |
| 28 | + num consists of only 6 and 9 digits. |
| 29 | + """ |
| 30 | + num = list(str(num)) |
| 31 | + for i in range(len(num)): |
| 32 | + if num[i] == '6': |
| 33 | + num[i] = '9' |
| 34 | + break |
| 35 | + return int(''.join(num)) |
| 36 | + |
| 37 | + |
| 38 | +def test(): |
| 39 | + assert Solution().maximum69Number(num=9669) == 9969 |
| 40 | + assert Solution().maximum69Number(num=9996) == 9999 |
| 41 | + assert Solution().maximum69Number(num=9999) == 9999 |
| 42 | + |
| 43 | + |
| 44 | +if __name__ == '__main__': |
| 45 | + test() |
0 commit comments