题解 | #矩阵乘法#
矩阵乘法
http://www.nowcoder.com/practice/ebe941260f8c4210aa8c17e99cbc663b
个人感觉华为的题库，中等题中部分题中规中矩
估计这些题侧重考察的是基础能力，这道题纯纯的按题目要求来即可；
感觉递归套两层循环应该也能做~
既然考察基础，就用暴力美学写一下吧【doge】
#include<iostream>
#include<vector>
using namespace std;
int first_row;//第一个矩阵的行
int first_col;//第一个矩阵的列
int second_row;//第二个矩阵的行
int second_col;//第二个矩阵的列
void deal_fun(vector<vector<int>>&f_matrix,vector<vector<int>>&s_matrix,vector<vector<long int>>&result_matrix,int row)
{
int a = -1;
while (a < second_col)
{
a++;
if (a >= second_col)break;
long int result = 0;
for (int j = 0; j < first_col; j++)
{
result+= f_matrix[row][j] * s_matrix[j][a];
}
result_matrix[row][a] = result;
}
}
int main()
{
cin >> first_row >> first_col >> second_col;
second_row = first_col;
vector<vector<int>>f_matrix(first_row, vector<int>(first_col, 0));
vector<vector<int>>s_matrix(second_row, vector<int>(second_col, 0));
for (int i = 0; i < first_row; i++)
{
for (int j = 0; j < first_col; j++)
cin >> f_matrix[i][j];
}
for (int i = 0; i < second_row; i++)
{
for (int j = 0; j < second_col; j++)
cin >> s_matrix[i][j];
}
vector<vector<long int>>result_matrix(first_row, vector<long int>(second_col));
for (int i = 0; i < first_row; i++)
{
deal_fun(f_matrix, s_matrix, result_matrix, i);
}
for (int i = 0; i < first_row; i++)
{
for (int j = 0; j < second_col; j++)
{
cout << result_matrix[i][j] << " ";
}
cout << endl;
}
return 0;
}
投递饿了么等公司10个岗位 >