LeetCode知识点总结 - 1323

LeetCode 1323. Maximum 69 Number

考点	难度
Greedy	Easy

题目

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).

思路

把从左边数的第一个6改成9。

答案

public int maximum69Number (int num) {
        StringBuilder sb = new StringBuilder();
        
        sb.append(num);
        for(int i = 0 ; i < sb.length() ; i++){
            if(sb.charAt(i) != '9'){
                sb.setCharAt(i,'9');
                break;
            }
        }
        
        return Integer.parseInt(sb.toString());
}