算法
const merge =(left,right)=>{
//合并数组
let result =[]
//使用shift(方法)删除第一个 元素,返回该值
while (left.length &&right.length){
if(left.length>0){
if(left[0]<=right[0]){
result.push(left.shift())
}else{
result.push(right.shift())
}
}
while