| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2025 Eugene Eremeev (also known as Yevhenii Yeriemeieiv). |
| | | 3 | | // All Rights Reserved. |
| | | 4 | | // -------------------------------------------------------------------------------- |
| | | 5 | | // This software is the confidential and proprietary information of Eugene Eremeev |
| | | 6 | | // (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not |
| | | 7 | | // disclose such Confidential Information and shall use it only in accordance with |
| | | 8 | | // the terms of the license agreement you entered into with Eugene Eremeev (also |
| | | 9 | | // known as Yevhenii Yeriemeieiv). |
| | | 10 | | // -------------------------------------------------------------------------------- |
| | | 11 | | |
| | | 12 | | namespace LeetCode.Algorithms.Maximum69Number; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class Maximum69NumberIterative : IMaximum69Number |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(log n) |
| | | 19 | | /// Space complexity - O(1) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="num"></param> |
| | | 22 | | /// <returns></returns> |
| | | 23 | | public int Maximum69Number(int num) |
| | 20 | 24 | | { |
| | 20 | 25 | | var multiplier = 1; |
| | 20 | 26 | | var maximum = 9; |
| | | 27 | | |
| | 65 | 28 | | while (num != maximum) |
| | 61 | 29 | | { |
| | 61 | 30 | | if (num < maximum) |
| | 20 | 31 | | { |
| | 20 | 32 | | if (num + (3 * multiplier) > maximum) |
| | 11 | 33 | | { |
| | 11 | 34 | | if (num + (3 * multiplier / 10) > maximum) |
| | 4 | 35 | | { |
| | 4 | 36 | | multiplier /= 10; |
| | 4 | 37 | | } |
| | | 38 | | else |
| | 7 | 39 | | { |
| | 7 | 40 | | return num + (3 * multiplier / 10); |
| | | 41 | | } |
| | 4 | 42 | | } |
| | | 43 | | else |
| | 9 | 44 | | { |
| | 9 | 45 | | return num + (3 * multiplier); |
| | | 46 | | } |
| | 4 | 47 | | } |
| | | 48 | | else |
| | 41 | 49 | | { |
| | 41 | 50 | | multiplier *= 10; |
| | 41 | 51 | | maximum = (maximum * 10) + 9; |
| | 41 | 52 | | } |
| | 45 | 53 | | } |
| | | 54 | | |
| | 4 | 55 | | return num; |
| | 20 | 56 | | } |
| | | 57 | | } |