leetcode 54 spiralMatrix

#include<iostream>
#include<vecotr>

using namespace std;

class Solution {
public:
    vector<int> spiralOrder(vector<vector<int>>& matrix) {
		vector<int> res;
 		if(matrix.empty()){
			return res;
		}     
		int layer_num = min(matrix.size(),matrix[0].size())/2;
		int row_num = matrix.size();
		int column_num = matrix[0].size();
		for(int layer = 0;lay<layer_num;layer++){
			for(int i = layer;i< column_num - layer -1;i++){
					res.push_back(matrix[layer][i];
				}
			for(int i = layer;i< row_num - layer -1;i++){
					res.push_back(matrix[i][column_num-layer-1];
				}
			for(int i = column_num-layer_num-1;i>=layer ;i--){
					res.push_back(matrix[row_num-layer-1][i];
				}
			for(int i = row_num-layer_num-1;i>=layer ;i--){
					res.push_back(matrix[i][layer];
				}
		}
		if (row_num < column_num){
			for(int i = layer_num;i<column_num - layer_num -1;i++){
				res.push_back(matrix[layer_num][i];	
			}	
		}
		if (row_num > column_num){
			for(int i = layer_num;i<row_num - layer_num -1;i++){
				res.push_back(matrix[i][layer_num];	
			}	
		}
    }
};