编程:键盘输入10个数(可能为整形、浮点型、双精度型及其字符类型),分别利用函数重载和函数模板,求出其中的最大值和最小值。
时间: 2023-05-30 15:04:38 浏览: 40
函数重载版本:
#include <iostream>
using namespace std;
int getMax(int arr[], int size) {
int max = arr[0];
for (int i = 1; i < size; i++) {
if (arr[i] > max) {
max = arr[i];
}
}
return max;
}
float getMax(float arr[], int size) {
float max = arr[0];
for (int i = 1; i < size; i++) {
if (arr[i] > max) {
max = arr[i];
}
}
return max;
}
double getMax(double arr[], int size) {
double max = arr[0];
for (int i = 1; i < size; i++) {
if (arr[i] > max) {
max = arr[i];
}
}
return max;
}
char getMax(char arr[], int size) {
char max = arr[0];
for (int i = 1; i < size; i++) {
if (arr[i] > max) {
max = arr[i];
}
}
return max;
}
int getMin(int arr[], int size) {
int min = arr[0];
for (int i = 1; i < size; i++) {
if (arr[i] < min) {
min = arr[i];
}
}
return min;
}
float getMin(float arr[], int size) {
float min = arr[0];
for (int i = 1; i < size; i++) {
if (arr[i] < min) {
min = arr[i];
}
}
return min;
}
double getMin(double arr[], int size) {
double min = arr[0];
for (int i = 1; i < size; i++) {
if (arr[i] < min) {
min = arr[i];
}
}
return min;
}
char getMin(char arr[], int size) {
char min = arr[0];
for (int i = 1; i < size; i++) {
if (arr[i] < min) {
min = arr[i];
}
}
return min;
}
int main() {
int intArr[10];
float floatArr[10];
double doubleArr[10];
char charArr[10];
cout << "Enter 10 integers:" << endl;
for (int i = 0; i < 10; i++) {
cin >> intArr[i];
}
cout << "Max int: " << getMax(intArr, 10) << endl;
cout << "Min int: " << getMin(intArr, 10) << endl;
cout << "Enter 10 floats:" << endl;
for (int i = 0; i < 10; i++) {
cin >> floatArr[i];
}
cout << "Max float: " << getMax(floatArr, 10) << endl;
cout << "Min float: " << getMin(floatArr, 10) << endl;
cout << "Enter 10 doubles:" << endl;
for (int i = 0; i < 10; i++) {
cin >> doubleArr[i];
}
cout << "Max double: " << getMax(doubleArr, 10) << endl;
cout << "Min double: " << getMin(doubleArr, 10) << endl;
cout << "Enter 10 chars:" << endl;
for (int i = 0; i < 10; i++) {
cin >> charArr[i];
}
cout << "Max char: " << getMax(charArr, 10) << endl;
cout << "Min char: " << getMin(charArr, 10) << endl;
return 0;
}
函数模板版本:
#include <iostream>
using namespace std;
template<typename T>
T getMax(T arr[], int size) {
T max = arr[0];
for (int i = 1; i < size; i++) {
if (arr[i] > max) {
max = arr[i];
}
}
return max;
}
template<typename T>
T getMin(T arr[], int size) {
T min = arr[0];
for (int i = 1; i < size; i++) {
if (arr[i] < min) {
min = arr[i];
}
}
return min;
}
int main() {
int intArr[10];
float floatArr[10];
double doubleArr[10];
char charArr[10];
cout << "Enter 10 integers:" << endl;
for (int i = 0; i < 10; i++) {
cin >> intArr[i];
}
cout << "Max int: " << getMax(intArr, 10) << endl;
cout << "Min int: " << getMin(intArr, 10) << endl;
cout << "Enter 10 floats:" << endl;
for (int i = 0; i < 10; i++) {
cin >> floatArr[i];
}
cout << "Max float: " << getMax(floatArr, 10) << endl;
cout << "Min float: " << getMin(floatArr, 10) << endl;
cout << "Enter 10 doubles:" << endl;
for (int i = 0; i < 10; i++) {
cin >> doubleArr[i];
}
cout << "Max double: " << getMax(doubleArr, 10) << endl;
cout << "Min double: " << getMin(doubleArr, 10) << endl;
cout << "Enter 10 chars:" << endl;
for (int i = 0; i < 10; i++) {
cin >> charArr[i];
}
cout << "Max char: " << getMax(charArr, 10) << endl;
cout << "Min char: " << getMin(charArr, 10) << endl;
return 0;
}
相关推荐
![pdf](https://img-home.csdnimg.cn/images/20210720083512.png)
![zip](https://img-home.csdnimg.cn/images/20210720083736.png)
![pdf](https://img-home.csdnimg.cn/images/20210720083512.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![pdf](https://img-home.csdnimg.cn/images/20210720083512.png)
![pdf](https://img-home.csdnimg.cn/images/20210720083512.png)
![](https://img-home.csdnimg.cn/images/20210720083646.png)
![docx](https://img-home.csdnimg.cn/images/20210720083331.png)
![pdf](https://img-home.csdnimg.cn/images/20210720083512.png)