packagemedium;

importjava.util.Arrays;

publicclassMinimumMovestoEqualArrayElementsII {

publicstaticintminMoves2(int[]nums) {

Arrays.sort(nums);

intresult =0,result1 =0;

if (nums.length%2 !=0) {

intmedian =nums[nums.length/2];

for (intn :nums) {

result +=Math.abs(n -median);

}

returnresult;

}else {

intmedian1 =nums[nums.length/2];

for (intn :nums) {

result1 +=Math.abs(n -median1);

}

intresult2 =0;

intmedian2 =nums[nums.length/2-1];

for (intn :nums) {

result2 +=Math.abs(n -median2);

}

result1 =Math.min(result1,result2);

returnresult1;

}

}

publicstaticvoidmain(String...args){

int[]nums =newint[]{1,2,3};

System.out.println(minMoves2(nums));

}

}

| # | Title | Solutions | Time | Space | Difficulty | Tag | Notes

|-----|----------------|---------------|---------------|---------------|-------------|--------------|-----

|463|[Island Perimeter](https://leetcode.com/problems/island-perimeter/)|[Solution](../../blob/master/EASY/src/easy/IslandPerimeter.java)| O(m*n)|O(1)| Easy|

|462|[Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/)|[Solution](../../blob/master/MEDIUM/src/medium/MinimumMovestoEqualArrayElementsII.java)| O(nlogn)|O(1)| Medium|

|459|[Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern/)|[Solution](../../blob/master/EASY/src/easy/RepeatedSubstringPattern.java)| O(n)|O(n) | Easy| KMP

|456|[132 Pattern](https://leetcode.com/problems/132-pattern/)|[Solution](../../blob/master/MEDIUM/src/medium/_132Pattern.java) | O(n) |O(n) | Medium| Stack

|455|[Assign Cookies](https://leetcode.com/problems/assign-cookies/)|[Solution](../../blob/master/EASY/src/easy/AssignCookies.java)| O(n)|O(1)| Easy|