| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2026 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.CountOperationsToObtainZero; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public sealed class CountOperationsToObtainZeroDivision : ICountOperationsToObtainZero |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(log(min(num1, num2))) |
| | | 19 | | /// Space complexity - O(1) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="num1"></param> |
| | | 22 | | /// <param name="num2"></param> |
| | | 23 | | /// <returns></returns> |
| | | 24 | | public int CountOperations(int num1, int num2) |
| | 2 | 25 | | { |
| | 2 | 26 | | if (num1 == 0 || num2 == 0) |
| | 0 | 27 | | { |
| | 0 | 28 | | return 0; |
| | | 29 | | } |
| | | 30 | | |
| | 2 | 31 | | if (num1 == num2) |
| | 1 | 32 | | { |
| | 1 | 33 | | return 1; |
| | | 34 | | } |
| | | 35 | | |
| | 1 | 36 | | var count = 0; |
| | | 37 | | |
| | 3 | 38 | | while (num1 != 0 && num2 != 0) |
| | 2 | 39 | | { |
| | 2 | 40 | | if (num1 > num2) |
| | 1 | 41 | | { |
| | 1 | 42 | | count += num1 / num2; |
| | | 43 | | |
| | 1 | 44 | | num1 %= num2; |
| | 1 | 45 | | } |
| | | 46 | | else |
| | 1 | 47 | | { |
| | 1 | 48 | | count += num2 / num1; |
| | | 49 | | |
| | 1 | 50 | | num2 %= num1; |
| | 1 | 51 | | } |
| | 2 | 52 | | } |
| | | 53 | | |
| | 1 | 54 | | return count; |
| | 2 | 55 | | } |
| | | 56 | | } |