注意：在每次進行循環(huán)進行讀寫時，一定要判斷l(xiāng)eft、right、top、bom的關系

vector<int> printMatrix(vector<vector<int> > matrix) {vector<int> vecResult;if (matrix.size() == 0)return vecResult;int rowCount = matrix.size();int colCount = matrix[0].size();int left = 0, right = colCount - 1;int top = 0, bom = rowCount - 1;while (left <= right && top <= bom){for (int i = left; i <= right; i++){vecResult.push_back(matrix[top][i]);}if(top<bom)for (int i = top + 1; i <= bom; i++){vecResult.push_back(matrix[i][right]);}if(top<bom&&left<right)for (int i = right - 1; i >= left; i--){vecResult.push_back(matrix[bom][i]);}if(top+1<bom&&left<right)for (int i = bom - 1; i >= top+1; i--){vecResult.push_back(matrix[i][left]);}left++; right--; top++; bom--;}return vecResult;}

總結(jié)

以上是生活随笔為你收集整理的剑指-顺时针打印矩阵的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。