附上3种有趣数组排列的形式及方法
感谢网蛹 ycccc春春 飞托托
/*排列形式
a[0] = [1, 3, 5, 7, 9, 11,13]
a[1] = [3, 3, 5, 7, 9, 11,13]
a[2] = [5, 5, 5, 7, 9, 11,13]
a[3] = [7, 7, 7, 7, 9, 11,13]
a[4] = [9, 9, 9, 9, 9, 11,13]
a[5] = [11,11,11,11,11,11,13]
a[6] = [13,13,13,13,13,13,13]
/*
//排列方法
a = new Array();
for (var i = 0; i<=6; i++) {
a = new Array();
}
for (var i = 0; i<=6; i++) {
for (var j = 0; j<=i; j++) {
a[j] = i*2+1;
a[j] = i*2+1;
}
}
for (var i = 0; i<=6; i++) {
trace(a);
}
/*形式，正方形矩阵
a[0] = [ 9, 9, 9, 9, 9, 9, 9, 9, 9];
a[1] = [ 9, 7, 7, 7, 7, 7, 7, 7, 9];
a[2] = [ 9, 7, 5, 5, 5, 5, 5, 7, 9];
a[3] = [ 9, 7, 5, 3, 3, 3, 5, 7, 9];
a[4] = [ 9, 7, 5, 3, 1, 3, 5, 7, 9];
a[5] = [ 9, 7, 5, 3, 3, 3, 5, 7, 9];
a[6] = [ 9, 7, 5, 5, 5, 5, 5, 7, 9];
a[7] = [ 9, 7, 7, 7, 7, 7, 7, 7, 9];
a[8] = [ 9, 9, 9, 9, 9, 9, 9, 9, 9];
//排列方法
function 建数组(count) {
var arr = [];
for (var c = 0; c = count;
arr[k][j] = count;
arr[k] = count;
arr[j][k] = count;
}
}
return arr;
}
//-----------trace--------
var _arr = 建数组(9);
for (var i = 0; i<_arr.length; i++) {
trace(_arr);
}
*/
//长方形矩阵
/*
allz[0] = [15, 13, 11, 9, 9, 9, 9, 9, 9, 9, 9, 9, 11, 13, 15];
allz[1] = [15, 13, 11, 9, 7, 7, 7, 7, 7, 7, 7, 9, 11, 13, 15];
allz[2] = [15, 13, 11, 9, 7, 5, 5, 5, 5, 5, 7, 9, 11, 13, 15];
allz[3] = [15, 13, 11, 9, 7, 5, 3, 3, 3, 5, 7, 9, 11, 13, 15];
allz[4] = [15, 13, 11, 9, 7, 5, 3, 1, 3, 5, 7, 9, 11, 13, 15];
allz[5] = [15, 13, 11, 9, 7, 5, 3, 3, 3, 5, 7, 9, 11, 13, 15];
allz[6] = [15, 13, 11, 9, 7, 5, 5, 5, 5, 5, 7, 9, 11, 13, 15];
allz[7] = [15, 13, 11, 9, 7, 7, 7, 7, 7, 7, 7, 9, 11, 13, 15];
allz[8] = [15, 13, 11, 9, 9, 9, 9, 9, 9, 9, 9, 9, 11, 13, 15];
*/
//排列方法
建数组 = function (高, 宽) {
数组 = new Array();
初值 = 1;
相差值 = 2;
中心点 = new Array(宽/2, 高/2);
for (var i = 0; i<=宽; i++) {
数组 = new Array();
for (var j = 0; j<=高; j++) {
比宽值 = Math.abs(i-中心点[0]);
比高值 = Math.abs(j-中心点[1]);
//比较
if (比宽值>比高值) {
数组[j] = 比宽值*相差值+初值;
} else {
数组[j] = 比高值*相差值+初值;
}
}
}
};
建数组(8, 6);
for (var i = 0; i<数组.length; i++) {
trace(数组);
}
