List容器实现
#include <iostream>
#include <list>
using namespace std;int main()
{list<int> l1;l1.assign(1,13);cout << *l1.begin() << endl;cout <<l1.front() << endl;l1.assign(2,78);l1.insert(l1.end(),100);l1.push_back(781);l1.push_front(900);cout << l1.size()<< endl;list<int>::iterator i;for(i=l1.begin();i!=l1.end();i++){cout << *i << " ";}cout << endl;l1.reverse();for(i=l1.begin();i!=l1.end();i++){cout << *i << " ";}cout << endl;return 0;
}
#include <iostream>using namespace std;
class Fun{int a;
public:Fun():a(0){};void set(int a);int Sun();int Porduct();void PrimeNumber();
};
void Fun::set(int a){this->a=a;
}
int Fun::Sun(){int sum=0;int n=a;while(n>=1){sum+=n;n--;}return sum;
}
int Fun::Porduct(){int Xun=1;int n=a;while(n>=1){Xun*=n;n--;}return Xun;
}
void Fun::PrimeNumber(){int n=a;while(n>1){if(n%2!=0){cout << n << '\t' ;}n--;}cout << endl;
}
int main()
{Fun s1;s1.set(5);cout << s1.Sun() << endl;cout << s1.Porduct() << endl;s1.PrimeNumber();return 0;
}