greedy_methods.minimize_deviation_in_array
==========================================

.. py:module:: greedy_methods.minimize_deviation_in_array

.. autoapi-nested-parse::

   You are given an array nums of n positive integers.

   You can perform two types of operations on any
   element of the array any number of times:

   If the element is even, divide it by 2.
   For example, if the array is [1,2,3,4], then you can do this operation
   on the last element, and the array will be [1,2,3,2].
   If the element is odd, multiply it by 2.
   For example, if the array is [1,2,3,4], then you can do this operation
   on the first element, and the array will be [2,2,3,4].
   The deviation of the array is the maximum difference between
   any two elements in the array.

   Return the minimum deviation the array can have after performing
   some number of operations.



Classes
-------

.. autoapisummary::

   greedy_methods.minimize_deviation_in_array.Solution


Module Contents
---------------

.. py:class:: Solution

   .. py:method:: minimum_deviation(nums: list[int]) -> int

      Function to find the minimum deviation of an array after performing operations.

      Args:
          nums (List[int]): A list of positive integers.

      Returns:
          temp_mindeviation (int): The minimum deviation of array after operations.

      Examples:
          >>> solution = Solution()
          >>> solution.minimum_deviation([1, 2, 3, 4])
          1
          >>> solution.minimum_deviation([5, 10, 20, 30, 30])
          5
          >>> solution.minimum_deviation([8, 8, 8, 8, 8])
          0