add 2164

fishercoder1534 · fishercoder1534 · commit 2b3ef66d03a2 · 2022-02-05T21:01:38.000-08:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |-----|----------------|---------------|--------|-------------|-------------
+|2164|[Sort Even and Odd Indices Independently](https://leetcode.com/problems/sort-even-and-odd-indices-independently/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2164.java) ||Easy||
 |2161|[Partition Array According to Given Pivot](https://leetcode.com/problems/partition-array-according-to-given-pivot/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2161.java) ||Medium||
 |2160|[Minimum Sum of Four Digit Number After Splitting Digits](https://leetcode.com/problems/minimum-sum-of-four-digit-number-after-splitting-digits/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2160.java) ||Easy||
 |2156|[Find Substring With Given Hash Value](https://leetcode.com/problems/find-substring-with-given-hash-value/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2156.java) ||Medium||
diff --git a/src/main/java/com/fishercoder/solutions/_2164.java b/src/main/java/com/fishercoder/solutions/_2164.java
@@ -0,0 +1,32 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.List;
+
+public class _2164 {
+    public static class Solution1 {
+        public int[] sortEvenOdd(int[] nums) {
+            List<Integer> odds = new ArrayList<>();
+            List<Integer> evens = new ArrayList<>();
+            for (int i = 0; i < nums.length; i++) {
+                if (i % 2 == 0) {
+                    evens.add(nums[i]);
+                } else {
+                    odds.add(nums[i]);
+                }
+            }
+            Collections.sort(odds, Collections.reverseOrder());
+            Collections.sort(evens);
+            int[] ans = new int[nums.length];
+            for (int i = 0, j = 0, k = 0; i < nums.length; i++) {
+                if (i % 2 == 0) {
+                    ans[i] = evens.get(j++);
+                } else {
+                    ans[i] = odds.get(k++);
+                }
+            }
+            return ans;
+        }
+    }
+}
