LeetCode --- 1323. Maximum 69 Number 解题报告

Posted 杨鑫newlfe

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode --- 1323. Maximum 69 Number 解题报告相关的知识,希望对你有一定的参考价值。

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 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
Outpu

以上是关于LeetCode --- 1323. Maximum 69 Number 解题报告的主要内容,如果未能解决你的问题,请参考以下文章

leetcode1323. Maximum 69 Number

LeetCode --- 1323. Maximum 69 Number 解题报告

LeetCode --- 1323. Maximum 69 Number 解题报告

Leetcode 1323. Maximum 69 Number

Leetcode 1323. Maximum 69 Number

LeetCode1323. 6 和 9 组成的最大数字(C++)