TheAlgorithms
diff --git a/‎greedy_methods/minimize_deviation_in_array.py‎
Lines changed: 3 additions & 3 deletions b/‎greedy_methods/minimize_deviation_in_array.py‎
Lines changed: 3 additions & 3 deletions
@@ -33,11 +33,11 @@ def minimum_deviation(self, nums) -> int:
 
         Examples:
             >>> solution = Solution()
-            >>> solution.minimumDeviation([1, 2, 3, 4])
+            >>> solution.minimum_deviation([1, 2, 3, 4])
             1
-            >>> solution.minimumDeviation([5, 10, 20, 30, 30])
+            >>> solution.minimum_deviation([5, 10, 20, 30, 30])
             5
-            >>> solution.minimumDeviation([8, 8, 8, 8, 8])
+            >>> solution.minimum_deviation([8, 8, 8, 8, 8])
             0
         """
         heapque = [-n * 2 if n % 2 else -n for n in nums]
Original file line number	Diff line number	Diff line change
`@@ -33,11 +33,11 @@ def minimum_deviation(self, nums) -> int:`
`33`	`33`
`34`	`34`	`Examples:`
`35`	`35`	`>>> solution = Solution()`
`36`		`- >>> solution.minimumDeviation([1, 2, 3, 4])`
	`36`	`+ >>> solution.minimum_deviation([1, 2, 3, 4])`
`37`	`37`	`1`
`38`		`- >>> solution.minimumDeviation([5, 10, 20, 30, 30])`
	`38`	`+ >>> solution.minimum_deviation([5, 10, 20, 30, 30])`
`39`	`39`	`5`
`40`		`- >>> solution.minimumDeviation([8, 8, 8, 8, 8])`
	`40`	`+ >>> solution.minimum_deviation([8, 8, 8, 8, 8])`
`41`	`41`	`0`
`42`	`42`	`"""`
`43`	`43`	`heapque = [-n * 2 if n % 2 else -n for n in nums]`