In this guide, you will get 1323. Maximum 69 Number LeetCode Solution with the best time and space complexity. The solution to Maximum Number problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.
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
Output: 9999
Explanation: It is better not to apply any change.
Constraints:
1 <= num <= 104
num consists of only 6 and 9 digits.
Complexity Analysis
Time Complexity: O(\log\texttt{num})
Space Complexity: O(\log\texttt{num})
1323. Maximum 69 Number LeetCode Solution in C++
class Solution {
public:
int maximum69Number(int num) {
string ans = to_string(num);
for (char& c : ans)
if (c == '6') {
c = '9';
break;
}
return stoi(ans);
}
}; /* code provided by PROGIEZ */
1323. Maximum 69 Number LeetCode Solution in Java
class Solution {
public int maximum69Number(int num) {
char[] ans = String.valueOf(num).toCharArray();
for (int i = 0; i < ans.length; ++i)
if (ans[i] == '6') {
ans[i] = '9';
break;
}
return Integer.valueOf(String.valueOf(ans));
}
} // code provided by PROGIEZ
1323. Maximum 69 Number LeetCode Solution in Python
class Solution:
def maximum69Number(self, num: int) -> int:
return int(str(num).replace('6', '9', 1)) # code by PROGIEZ
