最近面試的時候,面試官讓寫一個算法,給定一個二維數組 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] + " ");
}
}