最近面试的时候,面试官让写一个算法,给定一个二维数组 arr[][],逆时针输出该数组
说一说大概的思路,逆时针输出二维数组:
- 即从最外圈开始,慢慢想内圈渗透;
- 一圈分为四个过程,分别完成这四个过程;
- 而后向内圈渗透,重复上述过程;
话不多说,直接上代码,以下代码给出了核心处理逻辑:
int row = arr.length;
int col = arr[0].length;
int circle = (col + 1) / 2;
int index = 0, m , n ;
for (; index < circle; index++) {
for (m = index; m < row - index; m++) {
System.out.print(arr[m][index] + " ");
}
m = m - 1;
for (n = index + 1; n < col - index; n++) {
System.out.print(arr[m][n] + " ");
}
n = n - 1;
for (m = m - 1; m >= index; m--) {
System.out.print(arr[m][n] + " ");
}
m = m + 1;
for (n = n - 1; n > index; n--) {
System.out.print(arr[m][n] + " ");
}
}