华为OJ平台题目：蛇形矩阵

青旅半醒 2022-08-05 11:14 154阅读 0赞

<table style="border-spacing:0px; border-collapse:collapse; width:960px; margin-bottom:35px; table-layout:fixed; color:rgb(92,92,92); font-family:'Helvetica Neue',Helvetica,Arial,'Lantinghei SC','Hiragino Sans GB','Microsoft YaHei','Wenquanyi Micro Hei',sans-serif; font-size:14px; line-height:20px; widows:1"> 
 <tbody style=""> 
 <tr style=""> 
 <th style="padding:8px 0px; font-weight:normal; width:86px; margin:1px; border:2px solid rgb(255,255,255); background-color:rgb(207,235,252)"> 描述</th> 
 <td style="padding:8px 20px; word-break:break-all; word-wrap:break-word; border:2px solid rgb(255,255,255); width:872px; background-color:rgb(226,243,253)"> <pre style="overflow:hidden; font-family:monospace,monospace; font-size:1em; white-space:pre-wrap; word-wrap:break-word; line-height:24px">题目说明蛇形矩阵是由1开始的自然数依次排列成的一个矩阵上三角形。&nbsp;&nbsp;&nbsp;样例输入5样例输出1&nbsp;3&nbsp;6&nbsp;10&nbsp;152&nbsp;5&nbsp;9&nbsp;144&nbsp;8&nbsp;137&nbsp;1211接口说明原型void&nbsp;GetResult(int&nbsp;Num,&nbsp;char&nbsp;*&nbsp;pResult);输入参数：&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;int&nbsp;Num：输入的正整数N输出参数：&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;int&nbsp;*&nbsp;pResult：指向存放蛇形矩阵的字符串指针&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;指针指向的内存区域保证有效返回值：&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;void&nbsp;&nbsp;</pre> </td> 
 </tr> 
 <tr style=""> 
 <th style="padding:8px 0px; font-weight:normal; width:86px; margin:1px; border:2px solid rgb(255,255,255); background-color:rgb(207,235,252)"> 知识点</th> 
 <td style="padding:8px 20px; word-break:break-all; word-wrap:break-word; border:2px solid rgb(255,255,255); width:872px; background-color:rgb(226,243,253)"> 数组</td> 
 </tr> 
 <tr style=""> 
 <th style="padding:8px 0px; font-weight:normal; width:86px; margin:1px; border:2px solid rgb(255,255,255); background-color:rgb(207,235,252)"> 运行时间限制</th> 
 <td style="padding:8px 20px; word-break:break-all; word-wrap:break-word; border:2px solid rgb(255,255,255); width:872px; background-color:rgb(226,243,253)"> 10M</td> 
 </tr> 
 <tr style=""> 
 <th style="padding:8px 0px; font-weight:normal; width:86px; margin:1px; border:2px solid rgb(255,255,255); background-color:rgb(207,235,252)"> 内存限制</th> 
 <td style="padding:8px 20px; word-break:break-all; word-wrap:break-word; border:2px solid rgb(255,255,255); width:872px; background-color:rgb(226,243,253)"> 128</td> 
 </tr> 
 <tr style=""> 
 <th style="padding:8px 0px; font-weight:normal; width:86px; margin:1px; border:2px solid rgb(255,255,255); background-color:rgb(207,235,252)"> 输入</th> 
 <td style="padding:8px 20px; word-break:break-all; word-wrap:break-word; border:2px solid rgb(255,255,255); width:872px; background-color:rgb(226,243,253)"> 输入正整数N（N不大于100） &nbsp; </td> 
 </tr> 
 <tr style=""> 
 <th style="padding:8px 0px; font-weight:normal; width:86px; margin:1px; border:2px solid rgb(255,255,255); background-color:rgb(207,235,252)"> 输出</th> 
 <td style="padding:8px 20px; word-break:break-all; word-wrap:break-word; border:2px solid rgb(255,255,255); width:872px; background-color:rgb(226,243,253)"> 输出一个N行的蛇形矩阵。 &nbsp; </td> 
 </tr> 
 <tr style=""> 
 <th style="padding:8px 0px; font-weight:normal; width:86px; margin:1px; border:2px solid rgb(255,255,255); background-color:rgb(207,235,252)"> 样例输入</th> 
 <td style="padding:8px 20px; word-break:break-all; word-wrap:break-word; border:2px solid rgb(255,255,255); width:872px; background-color:rgb(226,243,253)"> 4</td> 
 </tr> 
 <tr style=""> 
 <th style="padding:8px 0px; font-weight:normal; width:86px; margin:1px; border:2px solid rgb(255,255,255); background-color:rgb(207,235,252)"> 样例输出</th> 
 <td style="padding:8px 20px; word-break:break-all; word-wrap:break-word; border:2px solid rgb(255,255,255); width:872px; background-color:rgb(226,243,253)"> 1 3 6 10 2 5 9 4 8 7</td> 
 </tr> 
 </tbody> 
</table>

**注意：在输出的每一行的后面不能带空格**

#include <iostream>
 #include <vector>
 #include <stdlib.h>
 #include <stack>
 
 using namespace std;
 #define MAX_NUMBER 100
 
 int main()
 {
 	int N = 0, i = 0, j = 0;
 	int a[MAX_NUMBER][MAX_NUMBER];
 
 	cin >> N;
 
 	for(i = 0; i < N; i++)
 	{
 		/* 先把第一行的计算出来 */
 		if(i == 0)
 		{
 			for(j = 0; j < N; j++)
 			{
 				a[0][j] = (j+1)*(j+2)/2;
 				if(j == 0)
 				{
 					cout << a[0][j];
 				}
 				else
 				{
 					cout << " " << a[0][j];
 				}
 			}
 		}
 		else
 		{
 			/* 其他的数等于右上角的数减1 */
 			for(j = 0; j < N-i; j++)
 			{
 				a[i][j] = a[i-1][j+1] - 1;
 				if(j == 0)
 				{
 					cout << a[i][j];
 				}
 				else
 				{
 					cout << " " << a[i][j];
 				}
 			}
 		}
 		cout << endl;
 	}
 
 	return 0;
 }