add 2161

fishercoder1534 · fishercoder1534 · commit 668223f8fd64 · 2022-02-05T08:16:49.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                  
 |-----|----------------|---------------|--------|-------------|-------------
+|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||
 |2155|[All Divisions With the Highest Score of a Binary Array](https://leetcode.com/problems/all-divisions-with-the-highest-score-of-a-binary-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2155.java) ||Medium||
diff --git a/src/main/java/com/fishercoder/solutions/_2161.java b/src/main/java/com/fishercoder/solutions/_2161.java
@@ -0,0 +1,39 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class _2161 {
+    public static class Solution1 {
+        public int[] pivotArray(int[] nums, int pivot) {
+            List<Integer> less = new ArrayList<>();
+            List<Integer> greater = new ArrayList<>();
+            int count = 0;
+            for (int i = 0; i < nums.length; i++) {
+                if (nums[i] < pivot) {
+                    less.add(nums[i]);
+                } else if (nums[i] > pivot) {
+                    greater.add(nums[i]);
+                } else {
+                    count++;
+                }
+            }
+            for (int i = 0; i < nums.length; ) {
+                int j = 0;
+                while (j < less.size()) {
+                    nums[i++] = less.get(j++);
+                }
+                j = 0;
+                while (j < count) {
+                    nums[i++] = pivot;
+                    j++;
+                }
+                j = 0;
+                while (j < greater.size()) {
+                    nums[i++] = greater.get(j++);
+                }
+            }
+            return nums;
+        }
+    }
+}
