leetcode1323. Maximum 69 Number
Posted seyjs
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了leetcode1323. Maximum 69 Number相关的知识,希望对你有一定的参考价值。
题目如下:
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 <= 10^4
num
‘s digits are 6 or 9.
解题思路:很简单的题目,把第一个6换成9就好了。
代码如下:
class Solution(object): def maximum69Number (self, num): """ :type num: int :rtype: int """ num = str(num) res = ‘‘ flag = False for i in list(num): if i == ‘6‘ and flag == False: res += ‘9‘ flag = True else: res += i return int(res)
以上是关于leetcode1323. Maximum 69 Number的主要内容,如果未能解决你的问题,请参考以下文章
LeetCode --- 1323. Maximum 69 Number 解题报告
Leetcode 1323. Maximum 69 Number
Leetcode 1323. Maximum 69 Number