Pascal三角形

 1 void YangHuiTriangleArray(int Row)                           
 2 {
 3     for (int i = 0;i < Row; i++)
 4     {
 5         for (int j = 0;j <= i; j++)
 6         {
 7             if (j == 0 || j == i)  //置1条件
 8                 a[i][j] = 1;
 9             else 
10                 a[i][j] = a[i - 1][j - 1] + a[i - 1][j];
11             cout<<a[i][j]<<" ";
12         }
13         cout<<endl;
14     }
15 }

 1 long GetElement(int Row,int Col)
 2 {
 3     if (0 == Col || Row == Col)   //递归出口
 4         return 1;
 5     else 
 6         return GetElement(Row - 1,Col - 1) + GetElement(Row - 1,Col);
 7 }
 8 
 9 void YangHuiTriangleRecur(const long n)
10 {
11     for(int i = 0;i < n; i++)
12     {
13         for(int j = 0; j <= i; j++)
14             cout<<GetElement(i,j)<<" ";
15         cout<<endl;
16     }
17 }

 1 void YangHuiTriangle(int RowN)
 2 {
 3     for (int i = 0;i < RowN;i++)
 4     {
 5         for (int j = 0;j <= i;j++)
 6         {
 7             if (j == 0)        //第一个数前面要输出相应的空格
 8             {
 9                 for (int k = 1;k < RowN - i; k++)
10                     cout<<"  ";
11             }
12             else 
13                 cout<<" ";                          //数与数之间输出相应空格  
14             printf("%3d",ComputeNextInteger(i,j));  //输出下一个数
15         }
16         cout<<endl;
17     }
18 }
19 
20 int ComputeNextInteger(int iRow ,int iRowIndex)
21 {
22     long p = 1;
23     for (int i = 1;i <= iRowIndex; i++)    
24         p = p * (iRow - i + 1)/i;            //根据公式计算每一个数；
25     return p;
26 }