杨辉三角:
#include <stdio.h>
int main(int argc, const char *argv[])
{
int arr[10][10] = {0};
int i = 0;
int j = 0;
int (*parr)[10] = arr;
for(i=0;i<10;i++){
for(j=0;j<=i;j++){
if(0 == j)
parr[i][0] = 1;
else
parr[i][j] = parr[i-1][j-1] + parr[i-1][j];
}
}
for(i=0;i<10;i++){
for(j=0;j<=i;j++){
printf("%5d",*(*(parr+i)+j));
}
printf("\n");
}
return 0;
}
二维数组最大值
#include <stdio.h>
int main(int argc, const char *argv[])
{
int arr[5][6] = {
{73,91,84,87,58,26},
{33,22,50,76,19,41},
{82,28,64,88,80,14},
{96,67,17,49,39,20},
{24,36,71,69,46,53}
};
int i = 0;
int j = 0;
int hang = 0;
int lie = 0;
int max = 0;
int (*parr)[6] = arr;
for(i=0;i<5;i++){
for(j=0;j<6;j++){
if(parr[i][j] > parr[hang][lie]){
hang = i;
lie = j;
}
else
continue;
}
}
printf("hang = %d,lie = %d,max = %d\n",hang,lie,parr[hang][lie]);
return 0;
}