js翻转数组

以下有三种方法，并对他们的耗时做了比较

const arr = [1, 2, 3, 4, 5]
// 第一种方法： 使用 reverse 方法  改变原数组
console.time('reverse')
console.log(arr, arr.reverse())
console.timeEnd('reverse')
// 第二种方法  不改变原数组
const arr1 = [1, 2, 3, 4, 5]

function filp(arr) {
    const newArr = []
    for (let i = arr.length - 1; i >= 0; i--) {
        newArr[newArr.length] = arr[i]
    }
    return newArr
}
console.time('filp()')
console.log(arr1, filp(arr1))
console.timeEnd('filp()')
//第三种方法   改变原数组 类似于reverse
const arr2 = [1, 2, 3, 4, 5]
function fun(arr) {
    const len = Math.ceil(arr.length / 2)
    for (let i = 0; i < len; i++) {
        let temp = arr[i]
        arr[i]=arr[arr.length-1-i]
        arr[arr.length-1-i]=temp
    }
    return arr
}
console.time('fun()')
console.log(arr2,fun(arr2))
console.timeEnd('fun()')

多次测试的结果

[ 5, 4, 3, 2, 1 ] [ 5, 4, 3, 2, 1 ]
reverse: 11.558ms
[ 1, 2, 3, 4, 5 ] [ 5, 4, 3, 2, 1 ]
filp(): 0.789ms
[ 5, 4, 3, 2, 1 ] [ 5, 4, 3, 2, 1 ]
fun(): 0.494ms

G:\VsCode\Code\20-面试\js>node 28-翻转数组.js
[ 5, 4, 3, 2, 1 ] [ 5, 4, 3, 2, 1 ]
reverse: 14.337ms
[ 1, 2, 3, 4, 5 ] [ 5, 4, 3, 2, 1 ]
filp(): 1.773ms
[ 5, 4, 3, 2, 1 ] [ 5, 4, 3, 2, 1 ]
fun(): 0.829ms

G:\VsCode\Code\20-面试\js>node 28-翻转数组.js
[ 5, 4, 3, 2, 1 ] [ 5, 4, 3, 2, 1 ]
reverse: 9.198ms
[ 1, 2, 3, 4, 5 ] [ 5, 4, 3, 2, 1 ]
filp(): 2.284ms
[ 5, 4, 3, 2, 1 ] [ 5, 4, 3, 2, 1 ]
fun(): 1.860ms

G:\VsCode\Code\20-面试\js>node 28-翻转数组.js
[ 5, 4, 3, 2, 1 ] [ 5, 4, 3, 2, 1 ]
reverse: 10.255ms
[ 1, 2, 3, 4, 5 ] [ 5, 4, 3, 2, 1 ]
filp(): 0.829ms
[ 5, 4, 3, 2, 1 ] [ 5, 4, 3, 2, 1 ]
fun(): 0.793ms

G:\VsCode\Code\20-面试\js>node 28-翻转数组.js
[ 5, 4, 3, 2, 1 ] [ 5, 4, 3, 2, 1 ]
reverse: 9.137ms
[ 1, 2, 3, 4, 5 ] [ 5, 4, 3, 2, 1 ]
filp(): 3.279ms
[ 5, 4, 3, 2, 1 ] [ 5, 4, 3, 2, 1 ]
fun(): 1.208ms

G:\VsCode\Code\20-面试\js>node 28-翻转数组.js
[ 5, 4, 3, 2, 1 ] [ 5, 4, 3, 2, 1 ]
reverse: 10.870ms
[ 1, 2, 3, 4, 5 ] [ 5, 4, 3, 2, 1 ]
filp(): 0.636ms
[ 5, 4, 3, 2, 1 ] [ 5, 4, 3, 2, 1 ]
fun(): 2.953ms

从上面可以看出reverse耗时是最长的，其次是filp，最后是fun