function removeWithoutCopy(arr, item) { while(arr.indexOf(item)!=-1) { arr.splice(arr.indexOf(item),1); } return arr; }
用递归的方式处理 function removeWithoutCopy(arr, item) { let i = arr.indexOf(item) if(i > -1){ arr.splice(i,1) return removeWithoutCopy(arr,item) } else { return arr } }
let num = 0 function removeWithoutCopy(arr, item) { if(num > arr.length){return arr} arr[num] === item ? arr.splice(arr.indexOf(item), 1) : num += 1 return removeWithoutCopy(arr,item) }递归的思路,最快1288ms
function removeWithoutCopy(arr, item) { for(let i = 0; i < arr.length; i++){ if (arr[i] == item){ arr.splice(i,1); i--; } } return arr; }
}
function removeWithoutCopy(arr, item) {var num = 0;for(var i = 0; i< arr.length; i++){if(arr[i] !== item && num != i){arr[++num] = arr[i];}}arr.length = ++num;}