My LeetCode grinding. Trying to do a problem a day.
Nevar pievienot vairāk kā 25 tēmas Tēmai ir jāsākas ar burtu vai ciparu, tā var saturēt domu zīmes ('-') un var būt līdz 35 simboliem gara.

problem.txt 164B

123
  1. Given a positive integer num consisting only of digits 6 and 9.
  2. Return the maximum number you can get by changing at most one digit (6 becomes 9, and 9 becomes 6).