leetcode-solutions-with-javascript/find-original-array-from-doubled-array.js at develop · imtomq/leetcode-solutions-with-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
35
36
37
38
39
/**
 * @param {number[]} changed
 * @return {number[]}
 */

// https://leetcode.com/problems/find-original-array-from-doubled-array/

var findOriginalArray = function (changed) {
  if (changed.length % 2 !== 0) return [];
  let result = [];
  let count = 0;

  changed.sort((a, b) => a - b);

  while (count < changed.length) {
    if (changed[count] > -1) {
      const firstEl = changed[count];
      let iMatch = changed.indexOf(firstEl * 2, count + 1);
      if (iMatch > 0) {
        result.push(firstEl);
        changed[count] = -1;
        changed[iMatch] = -1;
      } else {
        return [];
      }
    }
    count++;
  }

  return result;
};

// findOriginalArray([0, 3, 2, 4, 6, 0]);
// findOriginalArray([1]);
// console.log(findOriginalArray([6, 3, 0, 0, 4, 5]));
// console.log(findOriginalArray([1, 2, 2, 4, 1, 8]));
// console.log(findOriginalArray([4, 4, 16, 20, 8, 8, 2, 10]));
// console.log(findOriginalArray([0, 0, 0, 0]));
console.log(findOriginalArray([1, 3, 4, 2, 6, 8]));