C/C++经典杨辉三角问题解决方案

int** Creat(int m)
{
	// 杨辉三角每行数据与行数相同
    //先开二级指针
	int** triAngle = (int**)malloc(sizeof(int*) * m);
	assert(triAngle);
    // 再开二级指针中每个元素存储数据的数组
	for (size_t i = 0; i < m; i++)
	{
		triAngle[i] = (int*)malloc(sizeof(int) * (i + 1));
	}
	return triAngle;
}

void Init(int** triAngle, int m)
{
	// 先将两腰上的数据初始化为1
	for (size_t i = 0; i < m; i++)
	{
		if (i == 0)
		{
			triAngle[i][0] = 1;
		}
		else
		{
			triAngle[i][0] = triAngle[i][i - 1] = 1;
		}
	}
	// 构建杨辉三角
	for (size_t i = 0; i < m; i++)
	{
		for (size_t j = 0; j < i; j++)
		{
			if (triAngle[i][j] != 1)
			{
				triAngle[i][j] = triAngle[i - 1][j] + triAngle[i - 1][j - 1];
			}
		}
	}
}

void Print(int** triAngle, int m)
{
	for (size_t i = 0; i < m; i++)
	{
		for (size_t j = 0; j < i; j++)
		{
			printf("%d ", triAngle[i][j]);
		}
		printf("\n");
	}
}

void Destory(int** triAngle, int m)
{
	for (size_t i = 0; i < m; i++)
	{
		free(triAngle[i]);
	}
	free(triAngle);
}

class Yanghui
{
private:
	vector<vector<int>> _vv;
	size_t _n;
};

// 构建实现为构造函数就不用调用了
	Yanghui(int n = 5)
	{
		_vv.resize(n);
		for (size_t i = 0; i < _vv.size(); i++)
		{
			_vv[i].resize(i + 1);
		}
		// 先初始化两腰数据为1
		for (size_t i = 0; i < _vv.size(); i++)
		{
			_vv[i][0] = _vv[i][_vv[i].size() - 1] = 1;
		}
		// 构建杨辉三角
		for (size_t i = 0; i < _vv.size(); i++)
		{
			for (size_t j = 0; j < _vv[i].size(); j++)
			{
				if (_vv[i][j] != 1)
				{
					_vv[i][j] = _vv[i - 1][j] + _vv[i - 1][j - 1];
				}
			}
		}
	}

void Print(int n)
	{
		for (size_t i = 0; i < n+1; i++)
		{
			for (size_t j = 0; j < i; j++)
			{
				cout << _vv[i][j] << " ";
			}
			cout << endl;
		}
	}

#include <vector>
using namespace std;
class Yanghui
{
public:
	// 构建实现为构造函数就不用调用了
	Yanghui(int n = 5)
	{
		_vv.resize(n);
		for (size_t i = 0; i < _vv.size(); i++)
		{
			_vv[i].resize(i + 1);
		}
		// 先初始化两腰数据为1
		for (size_t i = 0; i < _vv.size(); i++)
		{
			_vv[i][0] = _vv[i][_vv[i].size() - 1] = 1;
		}
		// 构建杨辉三角
		for (size_t i = 0; i < _vv.size(); i++)
		{
			for (size_t j = 0; j < _vv[i].size(); j++)
			{
				if (_vv[i][j] != 1)
				{
					_vv[i][j] = _vv[i - 1][j] + _vv[i - 1][j - 1];
				}
			}
		}
	}
	void Print()
	{
		for (size_t i = 0; i < _vv.size(); i++)
		{
			for (size_t j = 0; j < _vv[i].size(); j++)
			{
				cout << _vv[i][j] << " ";
			}
			cout << endl;
		}
	}
	~Yanghui()
	{
		cout << "~Yanghui()" << endl;
	}
private:
	vector<vector<int>> _vv;
};
int main()
{
	Yanghui triAngle(5);
	triAngle.Print();
	return 0;
}