add 3736

Author: clingoram

javascript/LeetCode/Array/3736.js

@@ -0,0 +1,29 @@
+/**
+ * 3736. Minimum Moves to Equal Array Elements III
+ * 
+ * 參數為數值陣列，在一次操作中可將任一元素+1
+ * 回傳須移動幾次才能將所有元素都變得一樣
+ * 
+ * @param {number[]} nums
+ * @return {number}
+ */
+var minMoves = function(nums) {
+  // 要先知道nums中最大值是多少，這樣就能知道其他元素跟最大值差多少
+  let count = 0;
+  let maxEle = Math.max(...nums);
+  for(let i = 0;i < nums.length;++i) {
+    count += Math.abs(maxEle - nums[i]);
+  }
+  return count;
+};
+let nums = [2,1,3];
+/*
+Output: 3
+Explanation:
+To make all elements equal:
+Increase nums[0] = 2 by 1 to make it 3.
+Increase nums[1] = 1 by 1 to make it 2.
+Increase nums[1] = 2 by 1 to make it 3.
+Now, all elements of nums are equal to 3. The minimum total moves is 3.
+*/
+console.log(minMoves(nums))

javascript/index.js

@@ -1250,7 +1250,7 @@ var minRemoval = function(nums, k) {
   }
   return nums.length - count;
 };
-let nums = [1,6,2,9], k = 3;
+// let nums = [1,6,2,9], k = 3;
 // 2
 // Remove nums[0] = 1 and nums[3] = 9 to get nums = [6, 2].
 // Now max = 6, min = 2 and max <= min * k as 6 <= 2 * 3. Thus, the answer is 2.
@@ -1276,4 +1276,6 @@ Explanation: You can either:
 Delete the characters at 0-indexed positions 2 and 6 ("aababbab" -> "aaabbb"), or
 Delete the characters at 0-indexed positions 3 and 6 ("aababbab" -> "aabbbb").
 */
-// console.log(minimumDeletions(s));
+// console.log(minimumDeletions(s));
+
+