重修C++的大三老人笔记

  大一时C++考的太烂，所以重修啦，很多细致化的思想可以自行来过啦，blog is really a great thing,you are unlikely to be interrupted during your writing,Just hold on to it!

一是做项目无聊开始慢慢写的一个类，啊哈~~熟悉一下类的回归

#include<iostream>
#include<string>
using namespace std;


class student
{
public:
student()
{age= 0;}
student(int s_age,string s_name,string s_student_number)
{age= s_age;name= s_name;student_number= s_student_number;}
string display();
private:
int age;
string name;
string student_number;
};

string student::display()
{
return name;
}

void main()
{
student s1(20,"yanzhe","22012317");
student s2(20,"yuanchangwang","22012316");
student s3(20,"huanghualin","22012323");
student s4(20,"zhuyuting","22012207");
cout<<s1.display()<<"+"<<s2.display()<<"+"<<s3.display()<<"+"<<s4.display()<<"="<<"sucess"<<endl;
}

C++寻找最大数组的类模板

所有的类模板需要用到的私有成员（private member）都需要对应的类成员函数进行相关操作！！

操作成员函数中返回的一定是定义过的成员，return max和return data[pos]是一样的效果，可是return data[i]是错误的，因为i是一个局部变量

#include<iostream>

#include<conio.h>
using namespace std;

#define size 8
template<class T>
class add
{
public:
T findmax();
void put(T x);
add() : count(0), max(0), pos(0) {} //写类模板时构造函数不可少
private:
T data[size];
int count;
int pos;
T max;
};


template<class T>
T add<T>::findmax()
{
int i;
max = data[0];
for(i=1;i<8;i++)
{
if(max<data[i]) 
max = data[i];
pos=i;
}
return max;
}


template<class T>
void add<T>::put(T x)
{
data[count] = x; 
count++;
}




void main()
{
add<int> a;
for (int i=0;i<8;i++)
{
a.put(i);
}
cout<<a.findmax()<<endl;

}

明天写一个复数的opetator运算咯~~