feat: add solutions to lc problem: No.0462

No.0462.Minimum Moves to Equal Array Elements II

Author: yanglbme

solution/0400-0499/0462.Minimum Moves to Equal Array Elements II/README.md

@@ -27,22 +27,93 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+**方法一：排序 + 中位数**
+
+**方法二：排序 + 前缀和**
+
+以上两种方法的时间复杂度均为 O(nlogn)。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
+class Solution:
+    def minMoves2(self, nums: List[int]) -> int:
+        nums.sort()
+        k = nums[len(nums) >> 1]
+        return sum(abs(v - k) for v in nums)
+```
 
+```python
+class Solution:
+    def minMoves2(self, nums: List[int]) -> int:
+        def move(i):
+            v = nums[i]
+            a = v * i - s[i]
+            b = s[-1] - s[i + 1] - v * (n - i - 1)
+            return a + b
+
+        nums.sort()
+        s = [0] + list(accumulate(nums))
+        n = len(nums)
+        return min(move(i) for i in range(n))
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int minMoves2(int[] nums) {
+        Arrays.sort(nums);
+        int k = nums[nums.length >> 1];
+        int ans = 0;
+        for (int v : nums) {
+            ans += Math.abs(v - k);
+        }
+        return ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int minMoves2(vector<int>& nums) {
+        sort(nums.begin(), nums.end());
+        int k = nums[nums.size() >> 1];
+        int ans = 0;
+        for (int& v : nums) ans += abs(v - k);
+        return ans;
+    }
+};
+```
 
+### **Go**
+
+```go
+func minMoves2(nums []int) int {
+	sort.Ints(nums)
+	k := nums[len(nums)>>1]
+	ans := 0
+	for _, v := range nums {
+		ans += abs(v - k)
+	}
+	return ans
+}
+
+func abs(x int) int {
+	if x < 0 {
+		return -x
+	}
+	return x
+}
 ```
 
 ### **...**

solution/0400-0499/0462.Minimum Moves to Equal Array Elements II/README_EN.md

@@ -44,13 +44,78 @@ Only two moves are needed (remember each move increments or decrements one eleme
 ### **Python3**
 
 ```python
+class Solution:
+    def minMoves2(self, nums: List[int]) -> int:
+        nums.sort()
+        k = nums[len(nums) >> 1]
+        return sum(abs(v - k) for v in nums)
+```
 
+```python
+class Solution:
+    def minMoves2(self, nums: List[int]) -> int:
+        def move(i):
+            v = nums[i]
+            a = v * i - s[i]
+            b = s[-1] - s[i + 1] - v * (n - i - 1)
+            return a + b
+
+        nums.sort()
+        s = [0] + list(accumulate(nums))
+        n = len(nums)
+        return min(move(i) for i in range(n))
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int minMoves2(int[] nums) {
+        Arrays.sort(nums);
+        int k = nums[nums.length >> 1];
+        int ans = 0;
+        for (int v : nums) {
+            ans += Math.abs(v - k);
+        }
+        return ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int minMoves2(vector<int>& nums) {
+        sort(nums.begin(), nums.end());
+        int k = nums[nums.size() >> 1];
+        int ans = 0;
+        for (int& v : nums) ans += abs(v - k);
+        return ans;
+    }
+};
+```
 
+### **Go**
+
+```go
+func minMoves2(nums []int) int {
+	sort.Ints(nums)
+	k := nums[len(nums)>>1]
+	ans := 0
+	for _, v := range nums {
+		ans += abs(v - k)
+	}
+	return ans
+}
+
+func abs(x int) int {
+	if x < 0 {
+		return -x
+	}
+	return x
+}
 ```
 
 ### **...**

solution/0400-0499/0462.Minimum Moves to Equal Array Elements II/Solution.cpp

@@ -0,0 +1,10 @@
+class Solution {
+public:
+    int minMoves2(vector<int>& nums) {
+        sort(nums.begin(), nums.end());
+        int k = nums[nums.size() >> 1];
+        int ans = 0;
+        for (int& v : nums) ans += abs(v - k);
+        return ans;
+    }
+};

solution/0400-0499/0462.Minimum Moves to Equal Array Elements II/Solution.go

@@ -0,0 +1,16 @@
+func minMoves2(nums []int) int {
+	sort.Ints(nums)
+	k := nums[len(nums)>>1]
+	ans := 0
+	for _, v := range nums {
+		ans += abs(v - k)
+	}
+	return ans
+}
+
+func abs(x int) int {
+	if x < 0 {
+		return -x
+	}
+	return x
+}

solution/0400-0499/0462.Minimum Moves to Equal Array Elements II/Solution.java

@@ -1,11 +1,11 @@
 class Solution {
     public int minMoves2(int[] nums) {
         Arrays.sort(nums);
-        int k = nums[nums.length / 2];
-        int res = 0;
-        for (int num : nums) {
-            res += Math.abs(num - k);
+        int k = nums[nums.length >> 1];
+        int ans = 0;
+        for (int v : nums) {
+            ans += Math.abs(v - k);
         }
-        return res;
+        return ans;
     }
-}
+}

solution/0400-0499/0462.Minimum Moves to Equal Array Elements II/Solution.py

@@ -0,0 +1,5 @@
+class Solution:
+    def minMoves2(self, nums: List[int]) -> int:
+        nums.sort()
+        k = nums[len(nums) >> 1]
+        return sum(abs(v - k) for v in nums)