比如說(shuō)，兩個(gè)數(shù)組$newArray和$oldArray；//去插入的數(shù)組$newArray = ['n1' => ['fixed' => 2], 'n2' => ['fixed' => 5], 'n3' => ['fixed' => 8]];//被插入的數(shù)組$oldArray = ['o1' => [], 'o2' => [], 'o3' => [], 'o4' => [], 'o5' => [], 'o6' => [], 'o7' => []];//最終想要的數(shù)組$res = ['01' => [], 'n1' => [], 'o2' => [], 'o3' => [], 'n2' => [], 'o4' => [], 'o5' => [], 'n3' => [], 'o6' => [], 'o7' => []];$oldArray可以根據(jù)循環(huán)的時(shí)候，把$key+1，拿到對(duì)應(yīng)的排序；1...n這樣；$newArray的fixed字段就是我們手動(dòng)排序的固定位置；$res是我們最終想要的數(shù)組；有什么好的方法能實(shí)現(xiàn)這個(gè)需求呢？上面的兩個(gè)數(shù)組可能有點(diǎn)不太具體，這個(gè)是這里真實(shí)打印出來(lái)的兩個(gè)數(shù)組；上面這個(gè)是要去插入的數(shù)組，根據(jù)fixed字段去固定位置；下面這個(gè)數(shù)組是根據(jù)我們自己的排序算法拿到的數(shù)組；（被插入的數(shù)組）；