本文共 1289 字，大约阅读时间需要 4 分钟。

/*从键盘输入R行C列二维整型数组，找出每一行的次最大值并显示出来。要求：（1）R和C为符号常量；（2）二维数组是动态申请生成的；（3）每一行的次最大值是利用单独的函数调用获得的；（4）对数组元素的访问以及函数参数声明等都是利用指针实现的。*/#include
   
    #include
    
     using namespace std;void second_num(int** p, int R, int C);//查找次大数void disp(int **p, int R, int C);//显示当前数组int main(){	int R, C;	cout << "Please input Row and Column number: " << endl;	cin >> R >> C;	int **p = new int*[R]; //动态生成二维数组	for (int i = 0; i < R; i++) {		p[i] = new int[C];	}	//读入数值	cout << "Please input the array you want:" << endl;	for (int i = 0; i < R; i++)	{		for (int j = 0; j < C; j++)		{			cin >> *(*(p + i) + j);		}	}	disp(p, R, C);//显示当前数组	second_num(p, R, C);//查找次大数	system("pause");	delete []p;	return 0;}void disp(int **p,int R,int C)//显示当前数组{	cout << "The array is:" << endl;	for (int i = 0; i < R; i++)	{		for (int j = 0; j < C; j++)		{			cout << *(*(p + i) + j) << '\t';		}		cout << endl;	}}void second_num(int** p, int R, int C){	for (int i = 0; i < R; i++){		int flag = 1;//判定当前行是否有次大数		int max = 0;		int sec_max = 0;		for (int j = 0; j < C; j++){			if (j != 0 && p[i][j] > max) flag = 0;			if (p[i][j] > max) {				sec_max = max;				max = p[i][j];				}		}		if (flag) {			cout<< "Row " << i << " 次大值不存在:" << endl;		}		else {			cout << "Row " << i << " second largest number is :" << sec_max << endl;		}	}}
    
   

转载地址：http://aqdxi.baihongyu.com/