1323. Maximum 69 Number

  • Hardness: \(\color{green}\textsf{Easy}\)
  • Ralated Topics: Math、Greedy

一、題目

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 <= 10^4
  • num consists of only 6 and 9 digits.

二、分析

  • 觀察規律，從數字從左開始，將第一個 6 換成 9者為解。

三、解題

1. Greedy

  • Time complexity: \(O(n)\)
  • Space complexity: \(O(1)\)
int maximum69Number (int num) {
    string s = to_string(num);
    for (int i = 0; i < s.length(); i++) {
        if (s[i] == '6') {
            s[i] = '9';
            break;
        }
    }
    return stoi(s);
}

回目錄 Catalog