矩阵乘法C++实现

std::vector<std::vector<int>> matrix_mutiplication(const std::vector<std::vector<int>>& A,const std::vector<std::vector<int>>& B)
{
	int A_row = A.size(), A_col = A[0].size(), B_row = B.size(), B_col = B[0].size();
	assert(A_col == B_row);

	std::vector<std::vector<int>> C(A_row, std::vector<int>(B_col));
	for (int i = 0; i < C.size(); ++i)
	{
		for (int j = 0; j < C[0].size(); ++j)
		{
			for (int k = 0; k < A_col; ++k)
				C[i][j] += A[i][k] * B[k][j]; //C[i][j]等于A的第i行乘B的第j列
			//std::cout << C[i][j] << " ";
		}
		//std::cout << endl;
	}

	return C;
}