leetcode

0 class Solution {

1 public:

2 int maximum69Number(int num) {

3 string s = to_string(num);

4 for (int i = 0; i < size(s); i++) {

5 if (s[i] == '9') continue;

6 s[i] = '9';

7 return stoi(s);

8 }

9 return num;

10 }

11 };