C++程序解线性一次方程组

利用矩阵的思想解方程组，将线性一次方程组写成增广矩阵，编写代码将增广矩阵中的系数矩阵通过行与行相消转化为上三角矩阵。

#include "iostream"
 using namespace std;
#include"ctime"
#include"vector"

class solution                            
{
public:
	vector<double> solve(int n) {
		srand((unsigned)time(NULL));
		vector<vector<double>> data(n, vector<double>(n+1));
		for (int i = 0;i < n;i++)
		{
			for (int k = 0;k < n+1;k++)
			{

				data[i][k] = rand() % 10;      //填充矩阵
			}
		}
		//矩阵两行之间相消得到上三角阵
		double save1 = 0, save2 = 0;
		for (int k = 0;k < n;k++)
		{
			for (int j = k + 1;j < n;j++)
			{
				save1 = data[j][k]; //保存相消所需要的系数1
			    save2 = data[k][k];//保存相消所需要的系数2
				for (int m = 0;m < n+1;m++)
				{
					data[j][m] -= double(data[k][m] * save1 / save2);   //矩阵两行之间相消
				}

			}
		}
		vector<double>x(n,0);
		//从下往上依次求解
        for (int i = n-1;i >= 0;i--)																																																																																																							
		{
			double sum = 0;
			for (int k = 0;k < n;k++)
			{
				if (k == i)continue;
				sum += x[k] * data[i][k];
			}
			x[i] = (data[i][n] - sum) / data[i][i];        //求解
		}
		
		return x;
	}
	

};