利用队列打印杨辉三角形

谁践踏了优雅 2022-12-15 12:49 181阅读 0赞

问题 A: 打印杨辉三角  
题目描述

输入  
输入一行，为要打印的杨辉三角的行数  
输出  
输出杨辉三角，输出格式如图，其中每两个元素之间的空格数为3.最后一行的第一个‘1’之前空2格  
样例输入

样例输出

1
            1   1
          1   2   1
        1   3   3   1
      1   4   6   4   1

#include<iostream>
    #include<iomanip>
    using namespace std;
    using elemtype = int;
    const int MAXSIZE = 100;
    typedef struct Queue
    { 
    	elemtype* data;
    	int front, rear;
    };
    bool InitQueue(Queue& Q)
    { 
    	Q.rear = 0;
    	Q.front = 0;
    	Q.data = new elemtype[MAXSIZE];
    	return true;
    }
    bool EnQueue(Queue& Q, const elemtype e)
    { 
    	if ((Q.rear + 1) % MAXSIZE == Q.front)
    	{ 
    		cout << "队满" << endl;
    		return false;
    	}
    	Q.data[Q.rear] = e;
    	Q.rear = (Q.rear + 1) % MAXSIZE;
    	return true;
    }
    bool DeQueue(Queue& Q, elemtype& e)     //引用不加要出大问题的！！！
    { 
    	if (Q.rear == Q.front)
    	{ 
    		cout << "队空" << endl;
    		return false;
    	}
    	e = Q.data[Q.front];
    	Q.front = (Q.front + 1) % MAXSIZE;
    	return true;
    }
    bool IsEmpty(Queue Q)
    { 
    	return Q.rear == Q.front ? true : false;
    }
    void yanghui(int N)
    { 
    	int i, n, temp, m, add;
    	Queue Q;
    	InitQueue(Q);
    	m = N;
    	n = 1;
    	while (N >= n)
    	{ 
    		for (i = --m; i > 0; i--)
    			cout << " ";
    		cout << " 1";
    		EnQueue(Q, 1);
    		if (n == 1)
    		{ 
    			n++;
    			cout << endl;
    			continue;
    		}
    		DeQueue(Q, temp);
    		add = temp;
    		for (i = 2; i < n; i++)
    		{ 
    			DeQueue(Q, temp);
    			cout << " " << setw(2) << add + temp;
    			EnQueue(Q, add + temp);
    			add = temp;
    		}
    		cout << " 1" << endl;
    		EnQueue(Q, 1);
    		n++;
    	}
    }
    int main()
    { 
    	int n;
    	cin >> n;
    	yanghui(n);
    	return 0;
    }