数字缺失或重复,这个的看源码,你看看 content 这个对象的 load 方法的最后一个 for 循环:
for (var i = 0; i < e.length; i++) {
if (e[i] < 5) {
this.childNode[e[i]] = r(this.box.childNodes[i + this.star]);
j++
} else {
this.childNode[e[i] - j] = r(this.box.childNodes[i + this.star])
}
};
简化一下就是(感觉上是某个 hash 算法的逆过程):
for (var i = 0; i < e.length; i++) {
if (e[i] < 5) {
//序号不变,就是 e[i];
j++;//j 的初值为 0 ;
} else {
//序号为 e[i]-j
}
};
所以最终的顺序可以这么求(以下代码均可在 console 里执行,当然得打开网址:
http://www.99csw.com/book/3906/134399.htm ):
var e = base64.decode(document.getElementsByTagName('meta')[4].getAttribute('content')).split(/[A-Z]+%/);
var c=[], a=e.map(Number);
for(i=0;i<a.length;i++){if(a[i]<5){c.push(a[i]);j++;}else{c.push(a[i]-j);}}
最后结果是:
[17, 37, 33, 42, 29, 6, 27, 41, 39, 15, 22, 31, 25, 40, 12, 16, 5, 43, 7, 0, 26, 14, 21, 13, 24, 44, 36, 19, 18, 30, 8, 35, 20, 10, 3, 4, 28, 38, 23, 2, 1, 34, 32, 9, 11]
排一下续:
c.sort(function(a,b){return a-b;})
结果为:
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44]