codecamp

数组截断算法挑战

方法一:

function slasher(arr, howMany) {
// it doesn't always pay to be first
arr=arr.slice(howMany);
 return arr;
}
slasher([1, 2, 3], 2);

方法二:

function slasher(arr, howMany) {
  // it doesn't always pay to be first
  if(howMany === 0){
    return arr;
  }
  if(arr.length <= howMany){
    return [];
  }else{
    arr.splice(0,howMany);
    return arr;
  }
}


slasher([1, 2, 3], 2);
数组分割算法挑战
数组查询算法挑战
温馨提示
下载编程狮App,免费阅读超1000+编程语言教程
取消
确定