第3章第12题

关注

原创最新推荐文章于 2026-06-05 14:27:12 发布 556 阅读 AI 写同款· GEO 优化 ›

Java黑皮书课后题第3章：*3.30（当前时间）修改编程练习题2.8，以12小时时钟制显示小时数 *3.30（当前时间）修改编程练习题2.8，以12小时时钟制显示小时数题目题目概述编程练习题2.8破题代码题目题目概述 *3.30（当前时间）修改编程练习题2.8，以12小时时钟制显示小时数编程练习题2.8 欢迎点击这里前往我的2.8博文，或复制url到浏览器： https://blog.csdn.net/weixin_46356698/article/details/119783225 import java.util.Scanner; public class Test2_8 { p 阅读详情

#include<iostream>
using namespace std;

template <class numtype>
class Compare
{
	public:
		Compare(numtype a,numtype b):x(a),y(b){}
		numtype max();
		numtype min();
	private:
		numtype x;
	numtype y;
};

template <class numtype>
numtype Compare <numtype>::max()
{
	return x>y?x:y;
}

template <class numtype>
numtype Compare <numtype>::min()
{
	return x<y?x:y;
}

int main()
{
	Compare <int> cmp1(3,7);
	cout<<cmp1.max()<<" is the Maximum of two integer numbers."<<endl;
	cout<<cmp1.min()<<" is the Minimum of two integer numbers."<<endl;
	Compare <float> cmp2(45.78,93.6);
	cout<<cmp2.max()<<" is the Maximum of two float numbers."<<endl;
	cout<<cmp2.min()<<" is the Minimum of two float numbers."<<endl;
	Compare <char> cmp3('a','A');
	cout<<cmp3.max()<<" is the Maximum of two characters."<<endl;
	cout<<cmp3.min()<<" is the Minimum of two characters."<<endl;
	
	return 0;
}