思路
就是模拟找规律题:按照,右下左上的规律遍历
题目
输入一个矩阵,按照从外向里以顺时针的顺序依次打印出每一个数字。
样例
输入:
[
[1, 2, 3, 4],
[5, 6, 7, 8],
[9,10,11,12]
]
输出:[1,2,3,4,8,12,11,10,9,5,6,7]
java代码
class Solution {
public int[] printMatrix(int[][] matrix) {
int res[] = {};
int n = matrix.length;
if (n == 0) return res;
int m = matrix[0].length;
Boolean st[][] = new Boolean[n][m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
st[i][j] = false;
}
}
res = new int[n * m];
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
int x = 0, y = 0, d = 0;
for (int i = 0; i < n * m; i++) {
res[i] = matrix[x][y];
st[x][y] = true;
int a = x + dx[d], b = y + dy[d];
if (a < 0 || a >= n || b < 0 || b >= m || st[a][b]) {
d = (d + 1) % 4;
a = x + dx[d];
b = y + dy[d];
}
x = a;
y = b;
}
return res;
}
}