题目:
Write an algorithm that takes an array and moves all of the zeros to
the end, preserving the order of the other elements.
这道题目要我们实现的是,将一个数组中所有的零移到最后,其他元素保持顺序不变。
moveZeros([false,1,0,1,2,0,1,3,"a"]) // returns[false,1,1,2,1,3,"a",0,0]
测试用例:
moveZeros([1,2,0,1,0,1,0,3,0,1]) // returns [ 1, 2, 1, 1, 3, 1, 0, 0, 0, 0 ]
moveZeros([9,0.0,0,9,1,2,0,1,0,1,0.0,3,0,1,9,0,0,0,0,9]) // returns [9,9,1,2,1,1,3,1,9,9,0,0,0,0,0,0,0,0,0,0]
moveZeros(["a",0,0,"b","c","d",0,1,0,1,0,3,0,1,9,0,0,0,0,9]) // returns ["a","b","c","d",1,1,3,1,9,9,0,0,0,0,0,0,0,0,0,0]
moveZeros(["a",0,0,"b",null,"c","d",0,1,false,0,1,0,3,[],0,1,9,0,0,{},0,0,9]) // returns ["a","b",null,"c","d",1,false,1,3,[],1,9,{},9,0,0,0,0,0,0,0,0,0,0]
moveZeros([0,1,null,2,false,1,0]) // returns [1,null,2,false,1,0,0]
);
题解一:
// 方法一:将值不为0的压到新数组,再计算0的个数补0
var moveZeros = function (arr) {
// TODO: Program me
var newArr = [];
// 将值不为0的压到新数组,再补0
for(let i = 0;i<arr.length;i++){
if(arr[i] !== 0){
newArr.push(arr[i])
}
}
zeroLength = arr.length - newArr.length;
for(let j=0;j<zeroLength;j++) newArr.push(0)
return newArr;
}
题解二:
// 方法二:filter() 方法创建一个新的数组,新数组中的元素是通过检查指定数组中符合条件的所有元素。
// concat() 方法用于连接两个或多个数组。
var moveZeros = function (arr) {
return arr.filter((val)=>{return val!==0}).concat(arr.filter((val)=>{return val === 0}))
}