We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 24adf56 commit 1e169a0Copy full SHA for 1e169a0
problems/0054.螺旋矩阵.md
@@ -111,15 +111,12 @@ public:
111
// 如果min(rows, columns)为奇数的话,需要单独给矩阵最中间的位置赋值
112
if (min(rows, columns) % 2) {
113
if(rows > columns){
114
- for (int i = mid; i < mid + rows - columns + 1; ++i)
115
- {
+ for (int i = mid; i < mid + rows - columns + 1; ++i) {
116
res[count++] = matrix[i][mid];
117
}
118
119
- }
120
- else{
121
- for (int i = mid; i < mid + columns - rows + 1; ++i)
122
+ } else {
+ for (int i = mid; i < mid + columns - rows + 1; ++i) {
123
res[count++] = matrix[mid][i];
124
125
0 commit comments