例1:
[
[1,2],
[3,4]
]
顺时针旋转90度
[
[3,1],
[4,2]
];
例2:
$a = [
[1,2,3],
[4,5,6],
[7,8,9]
];
//旋转之后所得
$b = [
[7,4,1],
[8,5,2],
[9,6,3]
]
规律所得:
其中n代表是几阶,第一个例子,n是2,第二个例子,n是3
new[ i ][ j ] = old[ n-1-j] [ i ];
function swap($arr)
{
$n = count($arr);
$res = [];
foreach ($arr as $key => $value) {
foreach ($value as $key1 => $value1) {
$res[$key1][$n-1-$key] = $value1;
}
}
return $res;
}
逆时针旋转参考:
https://www.cnblogs.com/lca1826/p/6476452.html
思路】要完成旋转共需两步
1.第一次x,y互换
s1[i][j]=s[j][i]
1, 2, 3, 4
5, 6, 7, 8
9, 10,11,12
13,14,15,16
变成了
1, 5, 9, 13
2, 6,10,14
3, 7,11,15
4, 8,12,16
然后x逆序
s2[i][j]=s1[n-i][j]
变成了
4, 8,12,16
3, 7,11,15
2, 6,10,14
1, 5, 9, 13
旋转成功