Welcome to Subscribe On Youtube

Formatted question description: https://leetcode.ca/all/1323.html

1323. Maximum 69 Number (Easy)

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.

Related Topics:
Math

Solution 1.

// OJ: https://leetcode.com/problems/maximum-69-number
// Time: O(1)
// Space: O(1)
class Solution {
public:
    int maximum69Number (int num) {
        auto s = to_string(num);
        for (int i = 0; i < s.size(); ++i) {
            if (s[i] == '6') {
                s[i] = '9';
                break;
            }
        }
        return stoi(s);
    }
};

• Java
• C++
• Python
• Go
• TypeScript
• RenderScript

• class Solution {
      public int maximum69Number(int num) {
          char[] array = String.valueOf(num).toCharArray();
          int length = array.length;
          for (int i = 0; i < length; i++) {
              if (array[i] == '6') {
                  array[i] = '9';
                  break;
              }
          }
          return Integer.parseInt(new String(array));
      }
  }
  
  ############
  
  class Solution {
      public int maximum69Number(int num) {
          return Integer.valueOf(String.valueOf(num).replaceFirst("6", "9"));
      }
  }
  

• // OJ: https://leetcode.com/problems/maximum-69-number
  // Time: O(1)
  // Space: O(1)
  class Solution {
  public:
      int maximum69Number (int num) {
          auto s = to_string(num);
          for (int i = 0; i < s.size(); ++i) {
              if (s[i] == '6') {
                  s[i] = '9';
                  break;
              }
          }
          return stoi(s);
      }
  };
  

• class Solution:
      def maximum69Number(self, num: int) -> int:
          return int(str(num).replace("6", "9", 1))
  
  ############
  
  # 1323. Maximum 69 Number
  # https://leetcode.com/problems/maximum-69-number/
  
  class Solution:
      def maximum69Number (self, num: int) -> int:
          num = list(str(num))
          
          for i in range(len(num)):
              if num[i] == "6":
                  num[i] = "9"
                  break     
          
          return int("".join(num))
  

• func maximum69Number(num int) int {
  	s := strconv.Itoa(num)
  	nums := []byte(s)
  	for i, ch := range nums {
  		if ch == '6' {
  			nums[i] = '9'
  			break
  		}
  	}
  	ans, _ := strconv.Atoi(string(nums))
  	return ans
  }
  

• function maximum69Number(num: number): number {
      return Number((num + '').replace('6', '9'));
  }
  
  

• impl Solution {
      pub fn maximum69_number(num: i32) -> i32 {
          num.to_string().replacen('6', "9", 1).parse().unwrap()
      }
  }
  
  

All Problems

All Solutions