二维矩阵逆置

 

题目：求一个二维矩阵的逆置

分析：a[i][j]与a[j][i]交换位置即可一层一层交换

void re(vector<vector<int>>& vv)
{
	int j = 0;
	int k = j;//记录列
	for (int i = 0; i < vv.size(); i++)
	{
		for (; j < vv[i].size(); j++)
		{
			swap(vv[i][j], vv[j][i]);
		}
		j = ++k;//每一行与一列交换完，列也要加一次
	}
}


int main()
{
	int m, n;
	cin >> m >> n;
	vector<vector<int>> vv(m, vector<int>(n,0));
	for (int i = 0; i < m; i++)
	{
		for (int j = 0; j < n; j++)
		{
			cin >> vv[i][j];
		}
	}
	re(vv);
	for (auto e : vv)
	{
		for (auto c : e)
		{
			cout << c << " ";
		}
		cout << endl;
	}

	system("pause");
	return   0;
}