看了http://blog.csdn.net/chszs/article/details/1536661
用D语言实现之。
/* 请用D语言写一个函数printArray(int[][] aData),该函数将一个二维数组以顺时针螺旋的方式打印出来。
例如,对数组:
1 2 3 4 5
14 15 16 17 6
13 20 19 18 7
12 11 10 9 8
打印出来的序列应该是:1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20
*/
module turnPrint;
import std.stdio;
import std.array;
int row,len,turnsNumber,lastNumber = 20;
bool bStop =false;
int[][] arr;
void main()
{
int[][] aData = [[1,2,3,4,5],[14,15,16,17,6],[13,20,19,18,7],[12,11,10,9,8]];
printArray(aData);
}
void printArray(int[][] aData)
{
writeln("Origin array: ",aData);
len = aData.length;
arr = array(aData);
write("turn print array: ");
while(len)
{
orderPrint();
printEnd();
reversePrint();
printHead();
turnsNumber++;
if(bStop) break;
}
}
void orderPrint()
{
if(bStop) return;
for(int i=0+turnsNumber;i<(arr[row].length-turnsNumber);i++)
{
printIt(arr[row][i]);
}
row++;
}
void printEnd()
{
if(bStop) return;
while((len - row) > (turnsNumber+1))
{
printIt(arr[row][$-1]);
row++;
}
}
void reversePrint()
{
if(bStop) return;
for(int i= arr[row].length-1-turnsNumber;i>=turnsNumber;i--)
{
printIt(arr[row][i]);
}
row--;
}
void printHead()
{
if(bStop) return;
while(row - turnsNumber > 0)
{
printIt(arr[row][0+turnsNumber]);
row--;
}
row++;
}
void printIt(int a)
{
if(lastNumber == a)
{
write(a);
bStop = true;
}
else
{
write(a,',');
}
}