mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-07 15:45:40 +08:00
Update 0054.螺旋矩阵.md
This commit is contained in:
@ -111,15 +111,12 @@ public:
|
|||||||
// 如果min(rows, columns)为奇数的话,需要单独给矩阵最中间的位置赋值
|
// 如果min(rows, columns)为奇数的话,需要单独给矩阵最中间的位置赋值
|
||||||
if (min(rows, columns) % 2) {
|
if (min(rows, columns) % 2) {
|
||||||
if(rows > columns){
|
if(rows > columns){
|
||||||
for (int i = mid; i < mid + rows - columns + 1; ++i)
|
for (int i = mid; i < mid + rows - columns + 1; ++i) {
|
||||||
{
|
|
||||||
res[count++] = matrix[i][mid];
|
res[count++] = matrix[i][mid];
|
||||||
}
|
}
|
||||||
|
|
||||||
}
|
} else {
|
||||||
else{
|
for (int i = mid; i < mid + columns - rows + 1; ++i) {
|
||||||
for (int i = mid; i < mid + columns - rows + 1; ++i)
|
|
||||||
{
|
|
||||||
res[count++] = matrix[mid][i];
|
res[count++] = matrix[mid][i];
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
Reference in New Issue
Block a user