LeetCode 솔루션 분류

[11/7] 1323. Maximum 69 Number

컨텐츠 정보

본문

Easy
2104182Add to ListShare

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.
Accepted
183,911
Submissions
224,419
태그

관련자료

댓글 2

학부유학생님의 댓글

  • 익명
  • 작성일
Runtime: 64 ms, faster than 17.68% of Python3 online submissions for Maximum 69 Number.
Memory Usage: 13.7 MB, less than 95.47% of Python3 online submissions for Maximum 69 Number.
class Solution:
    def maximum69Number (self, num: int) -> int:
        
        num = list(str(num))
        
        for idx, char in enumerate(num):
            if char == "6":
                num[idx] = "9"
                break
        
        return int("".join(num))

                

jihoonjohnkim님의 댓글

  • 익명
  • 작성일
JAVA by jihoonjohnkim
class Solution {
    public int maximum69Number (int num) {
        String str = String.valueOf(num);
        System.out.println(num);
        str = str.replaceFirst("6","9");
        System.out.println(str);
        num = Integer.parseInt(str);
        return num;
    }
}
LeetCode 솔루션 357 / 1 페이지
번호
제목
이름

최근글


인기글


새댓글


Stats


  • 현재 접속자 921 명
  • 오늘 방문자 5,520 명
  • 어제 방문자 6,932 명
  • 최대 방문자 14,831 명
  • 전체 회원수 1,481 명
알림 0