1
// Time complexity = 2n = O(n)
2
// Space complexity = O(1), or O(n) if the result array is including in the complexity analysis.
3

4
class Solution {
5
  public int[] pivotArray(int[] nums, int pivot) {
6
    int[] result = new int[nums.length];
7
    int left = 0, right = nums.length - 1;
8

9
    for (int i = 0; i < nums.length; i++) {
10
      if (nums[i] < pivot) {
11
        result[left++] = nums[i];
12
      }
13
      if (nums[nums.length - 1 - i] > pivot) {
14
        result[right--] = nums[nums.length - 1 - i];
15
      }
16
    }
17

18
    while (left <= right) {
19
      result[left++] = pivot;
20
      result[right--] = pivot;
21
    }
22

23
    return result;
24
  }
25
}