| | | 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.MaximumProductOfTwoDigits; |
| | | 13 | | |
| | | 14 | | /// <summary> |
| | | 15 | | /// https://leetcode.com/problems/maximum-product-of-two-digits/description/ |
| | | 16 | | /// </summary> |
| | | 17 | | public class MaximumProductOfTwoDigitsGreedy : IMaximumProductOfTwoDigits |
| | | 18 | | { |
| | | 19 | | /// <summary> |
| | | 20 | | /// Time complexity - O(log n) |
| | | 21 | | /// Space complexity - O(1) |
| | | 22 | | /// </summary> |
| | | 23 | | /// <param name="n"></param> |
| | | 24 | | /// <returns></returns> |
| | | 25 | | public int MaxProduct(int n) |
| | 3 | 26 | | { |
| | 3 | 27 | | var max = 0; |
| | 3 | 28 | | var secondMax = 0; |
| | | 29 | | |
| | 10 | 30 | | while (n > 0) |
| | 7 | 31 | | { |
| | 7 | 32 | | var number = n % 10; |
| | | 33 | | |
| | 7 | 34 | | if (number > max) |
| | 4 | 35 | | { |
| | 4 | 36 | | secondMax = max; |
| | 4 | 37 | | max = number; |
| | 4 | 38 | | } |
| | 3 | 39 | | else if (number > secondMax) |
| | 2 | 40 | | { |
| | 2 | 41 | | secondMax = number; |
| | 2 | 42 | | } |
| | | 43 | | |
| | 7 | 44 | | n /= 10; |
| | 7 | 45 | | } |
| | | 46 | | |
| | 3 | 47 | | return max * secondMax; |
| | 3 | 48 | | } |
| | | 49 | | } |