两个js数组相关题目 about frontend-interview HOT 7 OPEN

function reCombine(array) {
  if (array.length > 1) {
    let recombinedArray = []
    for(let i = 0; i < array[0].length; i++) {
      for(let j = 0; j < array[1].length; j++) {
        recombinedArray.push([].concat(array[0][i], array[1][j]))
      }
    }
    recombinedArray = removeSame(recombinedArray)
    array.splice(0, 2, recombinedArray)
    reCombine(array)
  }
  return array[0]
}

function removeSame(array) {
  let newArray = [], hash = {}
  for (let i = 0; i < array.length; i++) {
    if (!hash[array[i]]) {
      hash[array[i]] = true
      newArray.push(array[i])
    }
  }
  return newArray
}

function obfs(arr) {
  return arr.slice().reduce(acc => [...acc, ...arr.splice(parseInt(Math.random() * arr.length, 10), 1)], []);
}

console.log(obfs([1, 2, 3, 4, 5]));

/* 
 * Returns a new array after disordered.
 * 
 * @param {array} array - The original array needs to be disordered.
 * @returns {array} newArray - A new array after disordered.
 *
 * @author Caijialinxx
 */
function disorderArray(array) {
  let newArray = []
  let usedIndexs = []    // Put the index of item which had been pushed into newArray. It helps to avoid adding repeated item.
  let validCount = 0     // The count of valid pushing into newArray.
  top:
  while(validCount < array.length) {
    let index = Math.floor(Math.random()*array.length)
    if(usedIndexs.indexOf(index) > -1) {
      continue top
    } else {
      usedIndexs.push(index)
    }
    validCount++
    newArray.push(array[index])
  }
  return newArray
}

function disorder(arry) {
  return arry.sort(function(a,b) {
     return Math.random() - Math.random();
  })
}