From aeb821429b40295686ff0f1053f555cb36af15d6 Mon Sep 17 00:00:00 2001 From: wisdompeak Date: Mon, 31 Oct 2022 01:19:31 -0700 Subject: [PATCH 1/3] Create 462.Minimum-Moves-to-Equal-Array-Elements-II.cpp --- .../462.Minimum-Moves-to-Equal-Array-Elements-II.cpp | 12 ++++++++++++ 1 file changed, 12 insertions(+) create mode 100644 Math/462.Minimum-Moves-to-Equal-Array-Elements-II/462.Minimum-Moves-to-Equal-Array-Elements-II.cpp diff --git a/Math/462.Minimum-Moves-to-Equal-Array-Elements-II/462.Minimum-Moves-to-Equal-Array-Elements-II.cpp b/Math/462.Minimum-Moves-to-Equal-Array-Elements-II/462.Minimum-Moves-to-Equal-Array-Elements-II.cpp new file mode 100644 index 000000000..9da968a42 --- /dev/null +++ b/Math/462.Minimum-Moves-to-Equal-Array-Elements-II/462.Minimum-Moves-to-Equal-Array-Elements-II.cpp @@ -0,0 +1,12 @@ +class Solution { +public: + int minMoves2(vector& nums) + { + sort(nums.begin(),nums.end()); + int median=nums[nums.size()/2]; + int result=0; + for (int i=0; i Date: Mon, 31 Oct 2022 01:27:51 -0700 Subject: [PATCH 2/3] Create Readme.md --- Math/462.Minimum-Moves-to-Equal-Array-Elements-II/Readme.md | 3 +++ 1 file changed, 3 insertions(+) create mode 100644 Math/462.Minimum-Moves-to-Equal-Array-Elements-II/Readme.md diff --git a/Math/462.Minimum-Moves-to-Equal-Array-Elements-II/Readme.md b/Math/462.Minimum-Moves-to-Equal-Array-Elements-II/Readme.md new file mode 100644 index 000000000..cc61fedc5 --- /dev/null +++ b/Math/462.Minimum-Moves-to-Equal-Array-Elements-II/Readme.md @@ -0,0 +1,3 @@ +### 462.Minimum-Moves-to-Equal-Array-Elements-II + +本题的本质就是`296.Best-Meeting-Point`。满足`minimize Sum{|xi-p|}`的最优点p就是{xi}的中位数。 From 59ca21af0a7e07b58e138171ef764a10d451ab9f Mon Sep 17 00:00:00 2001 From: wisdompeak Date: Mon, 31 Oct 2022 01:29:15 -0700 Subject: [PATCH 3/3] Update Readme.md --- Readme.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Readme.md b/Readme.md index b943280c6..6a97bae6c 100644 --- a/Readme.md +++ b/Readme.md @@ -1030,7 +1030,7 @@ [2217.Find-Palindrome-With-Fixed-Length](https://github.com/wisdompeak/LeetCode/tree/master/Math/2217.Find-Palindrome-With-Fixed-Length) (M+) * ``Distances`` [296.Best-Meeting-Point](https://github.com/wisdompeak/LeetCode/tree/master/Math/296.Best-Meeting-Point) (M+) -462.Minimum-Moves-to-Equal-Array-Elements-II +[462.Minimum-Moves-to-Equal-Array-Elements-II](https://github.com/wisdompeak/LeetCode/tree/master/Math/462.Minimum-Moves-to-Equal-Array-Elements-II) (M-) [2033.Minimum-Operations-to-Make-a-Uni-Value-Grid](https://github.com/wisdompeak/LeetCode/tree/master/Math/2033.Minimum-Operations-to-Make-a-Uni-Value-Grid) (M+) [1703.Minimum-Adjacent-Swaps-for-K-Consecutive-Ones](https://github.com/wisdompeak/LeetCode/tree/master/Math/1703.Minimum-Adjacent-Swaps-for-K-Consecutive-Ones) (H) [1478.Allocate-Mailboxes](https://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1478.Allocate-Mailboxes) (H)