solve problem Minimum Moves To Equal Array Elements

Author: P-ppc

README.md

@@ -96,6 +96,7 @@ All solutions will be accepted!
 |671|[Second Minimum Node In A Binary Tree](https://leetcode-cn.com/problems/second-minimum-node-in-a-binary-tree/description/)|[java/py/js](./algorithms/SecondMinimunNodeInABinaryTree)|Easy|
 |242|[Valid Anagram](https://leetcode-cn.com/problems/valid-anagram/description/)|[java/py/js](./algorithms/ValidAnagram)|Easy|
 |784|[Letter Case Permutation](https://leetcode-cn.com/problems/letter-case-permutation/description/)|[java/py/js](./algorithms/LetterCasePermutation)|Easy|
+|453|[Minimum Moves To Equal Array Elements](https://leetcode-cn.com/problems/minimum-moves-to-equal-array-elements/description/)|[java/py/js](./algorithms/MinimumMovesToEqualArrayElements)|Easy|
 
 # Database
 |#|Title|Solution|Difficulty|

algorithms/MinimumMovesToEqualArrayElements/README.md

@@ -0,0 +1,2 @@
+# Minimum Moves To Equal Array Elements
+This problem is easy to solve, it's a mathematical problem

algorithms/MinimumMovesToEqualArrayElements/Solution.java

@@ -0,0 +1,11 @@
+class Solution {
+    public int minMoves(int[] nums) {
+        int sum = 0,
+            minNum = Integer.MAX_VALUE;
+        for (int num : nums) {
+            sum += num;
+            minNum = Math.min(minNum, num);
+        }
+        return sum - minNum * nums.length;
+    }
+}

algorithms/MinimumMovesToEqualArrayElements/solution.js

@@ -0,0 +1,7 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var minMoves = function(nums) {
+    return nums.reduce((x, y) => x + y) - Math.min(...nums) * nums.length
+};

algorithms/MinimumMovesToEqualArrayElements/solution.py

@@ -0,0 +1,7 @@
+class Solution(object):
+    def minMoves(self, nums):
+        """
+        :type nums: List[int]
+        :rtype: int
+        """
+        return sum(nums) - min(nums) * len(nums)