Minimum moves to equal array elements.

Author: recherst

Easy/453.Minimum Moves to Equal Array Elements.playground/Contents.swift

@@ -0,0 +1,44 @@
+/**
+ Given an integer array nums of size n, return the minimum number of moves required to make all array elements equal.
+
+ In one move, you can increment n - 1 elements of the array by 1.
+
+  
+
+ Example 1:
+ Input: nums = [1,2,3]
+ Output: 3
+ Explanation: Only three moves are needed (remember each move increments two elements):
+ [1,2,3]  =>  [2,3,3]  =>  [3,4,3]  =>  [4,4,4]
+ 
+ Example 2:
+ Input: nums = [1,1,1]
+ Output: 0
+  
+
+ Constraints:
+ - n == nums.length
+ - 1 <= nums.length <= 105
+ - -109 <= nums[i] <= 109
+ - The answer is guaranteed to fit in a 32-bit integer.
+ */
+class Solution {
+    func minMoves(_ nums: [Int]) -> Int {
+        let newNums = nums.sorted()
+        if newNums.first! == newNums.last! {
+            return 0
+        }
+        let mini = newNums.first!
+        var sum = 0
+        for (i, e) in newNums.enumerated() {
+            if i > 0 {
+                sum += (e - mini)
+            }
+        }
+        return sum
+    }
+}
+
+let s = Solution()
+let r = s.minMoves([2, 4, 5, 7])
+print(r)

Easy/453.Minimum Moves to Equal Array Elements.playground/contents.xcplayground

@@ -0,0 +1,4 @@
+<?xml version="1.0" encoding="UTF-8" standalone="yes"?>
+<playground version='5.0' target-platform='ios' buildActiveScheme='true' importAppTypes='true'>
+    <timeline fileName='timeline.xctimeline'/>
+</playground>

Easy/453.Minimum Moves to Equal Array Elements.playground/playground.xcworkspace/contents.xcworkspacedata

@@ -89,7 +89,8 @@
 85. [Add Strings](https://github.com/recherst/leetcode-algtorithm/blob/main/Easy/415.Add%20Strings.playground/Contents.swift)
 86. [Number of Segments in a String](https://github.com/recherst/leetcode-algtorithm/blob/main/Easy/434.Number%20of%20Segments%20in%20a%20String.playground/Contents.swift)
 87. [Arranging Coins](https://github.com/recherst/leetcode-algtorithm/blob/main/Easy/441.Arranging%20Coins.playground/Contents.swift)
-88. [Find All Numbers Disappeared in an Array](https://github.com/recherst/leetcode-algtorithm/blob/main/Easy/448.Find%20All%20Numbers%20Disappeared%20in%20an%20Array.playground/Contents.swift)
+88. [Find All Numbers Disappeared in an Array](c)
+89. [Minimum Moves to Equal Array Elements](https://github.com/recherst/leetcode-algtorithm/blob/main/Easy/448.Minimum%20Moves%20toEqual%20Array%20Elements.playground/Contents.swift)
 
 #### Medium