js二维数组算法题

Question

一个js的二维数组面试题，请教下有没有简单点的处理方法：

var s = new Array(1000),//定义一个长度为1000的二维数组

//todo，一次操作后的期望结果

s = [.....,[1000,a]]

//todo,二次操作后的期望结果

s = [.....,[999,a],[1000,b]]

//todo,三次操作后的期望结果

s = [.....,[998,a],[999,b],[1000,c]]

....

最终的结果

   s= [[0,a],[1,b],[2,c],......]

各位大佬不吝赐教

Answer 1

var s = new Array(1000);var aWord=["a","b","c"];var k=1;function abc(){&nbsp; &nbsp;&nbsp;&nbsp; &nbsp; var d=1001;&nbsp; &nbsp;&nbsp;&nbsp; &nbsp; for(let i=0;i<k;i++){&nbsp; &nbsp; &nbsp; &nbsp;&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; s[d-k+i]=[d-k+i,aWord[i]];&nbsp; &nbsp; &nbsp; &nbsp;&nbsp;&nbsp; &nbsp; }&nbsp; &nbsp; k++;&nbsp; &nbsp;&nbsp;}abc();