基础算法复习之八：矩阵相乘

#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<limits.h>
using namespace std;
//矩阵相乘
vector<vector<int>>  MATMUL(vector<vector<int>> A, vector<vector<int>> B)
{
	int rA = A.size();
	int cA = A[0].size();
	int rB = B.size();
	int cB = B[0].size();
	vector<vector<int>>  AMB(rA,vector<int>(cB,0));
	if (cA != rB)
	{
		cout << " 两个矩阵不能相乘" << endl;
		return AMB;
	}
	for (int i = 0; i < rA; i++)
	{
		for (int j = 0; j < cB; j++)
		{
			for (int t = 0; t < cA; t++)
				AMB[i][j] += A[i][t] * B[t][j];
		}
	}
	return AMB;

}
int main()
{
	vector<vector<int>>  A;
	vector<int> nums{1,2,3};
	A.push_back(nums);
	nums={ 1,2,3 };
	A.push_back(nums);
	nums={ 1,2,3 };
	A.push_back(nums);
	vector<vector<int>>  B;
	nums={ 2,3,4 };
	B.push_back(nums);
	nums = { 2,3,4 };
	B.push_back(nums);
	nums = { 2,3,4 };
	B.push_back(nums);
	vector<vector<int>>  AB;
	AB = MATMUL(A,B);
	for (int i = 0; i < AB.size(); i++)
	{
		for (int j = 0; j < AB[0].size(); j++)
			cout << AB[i][j] << " ";
		cout << endl;
	}
	cout << endl;
	system("pause");
	return 0;
}