leetcode-javascript/solutions/0932-beautiful-array.js at development · Anuj9826/leetcode-javascript · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
/**
 * Beautiful Array
 * Time Complexity: O(N^2)
 * Space Complexity: O(N^2)
 */
var beautifulArray = function (n) {
  const resultCache = new Map();

  function recursiveSolver(currentSize) {
    if (resultCache.has(currentSize)) {
      return resultCache.get(currentSize);
    }

    if (currentSize === 1) {
      return [1];
    }

    const oddElementsSource = recursiveSolver(Math.ceil(currentSize / 2));
    const evenElementsSource = recursiveSolver(Math.floor(currentSize / 2));

    const transformedOdds = oddElementsSource.map(
      (elementValueOne) => elementValueOne * 2 - 1,
    );
    const transformedEvens = evenElementsSource.map(
      (elementValueTwo) => elementValueTwo * 2,
    );

    const finalArray = [...transformedOdds, ...transformedEvens];
    resultCache.set(currentSize, finalArray);
    return finalArray;
  }

  return recursiveSolver(n);
};