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.
public class Solution {
public int Maximum69Number (int num) {
int i = 0;
int index = -1;
int temp = num;
while(temp>0){
int mod = temp%10;
if(mod == 6){
index = i;
}
temp/=10;
i++;
}
if(index == -1){
return num;
}
return num+(int)(3*Math.Pow(10,index));
}
}
Time Complexity: O(logn)
Space Complexity: O(1)
Precisely, the number of digits for integer N is logN + 1. But the time complexity of this solution is O(logN),