Do not use loop to generate a length n=100, each item has a data type of number, and the value equals the array Arry of its subscript.

These two days in the group to see a group of UC international face test, while available, also over, the topic is as follows:

Simply done, the temporary implementation method is as follows:

①settimeout Timer

var i = 0,k = [],j;
function count () {
if (i > 100) {
Clearinterval (j);
Console.log (k);
}else{
K[i] = i++;
}
}
j = setinterval (function () {
Count ();
},20);

② recursion

var rr = []; function sum (n) {    if(n <) {        rr[n+1] = n + 1;         return sum (n+1);}    } Sum (0); Console.log (RR);

③map+join

var New Array (+), i = 0; var dd = Newarr.join (). Split (', ');dd. Map (function(item) {    if(i <)       {= i++;    }}); Console.log (NEWARR);

④array.apply (null,{length:100})

var newArr = array.apply (null, {length:100}), i = 0; Newarr.map (function(item, i) {    if(i <) {        = i++;}}    ); Console.log (NEWARR);

Think of this point for a moment, and think of a plus one at the back.

Do not use loop to generate a length n=100, each item has a data type of number, and the value equals the array Arry of its subscript.