83、84、85

#include <iostream>
#include <vector>
using namespace std;
typedef vector<int> INTVECTOR;
int main()
{
 INTVECTOR s;
 for (int i = 0; i < 5; i++) {
  s.push_back(i);
  cout << "增加一个元素后,整型向量容器对象s包含" << s.capacity() << "个元素" << endl;
 }
 return 0;
}
#include <iostream>
#include <typeinfo>
#include <list>
#include <deque>
#include <vector>
#include <ctime>
using namespace std;
template<class T>
void joseph(T collection, int n, int m) {
 if (n < 1 || m < 1) {
  cout << "错误的问题假设" << endl;
  return;
 }
 for (int i = 1; i <= n; i ++)
  collection.push_back(i);
 typename T::iterator iter = collection.begin(), del;
 int counter = 1;
 clock_t start = clock(), finish;
 while (collection.size() > 1) {
  while (counter % m == 0 && collection.size() > 1) {
   counter = 1;
   if (typeid(collection) != typeid(list<int>))
    iter = collection.erase(iter);
   else {
    del = iter;
    iter ++;
    collection.erase(del);
   }
   if (iter == collection.end())
    iter = collection.begin();
  }
  counter ++;
  iter ++;
  if (iter == collection.end())
   iter = collection.begin();
 }
 finish = clock();
 cout << "最后剩余的人的编号是" << *iter << endl;
 cout << "使用容器" << typeid(collection).name() << "的运算时间为" << 1.0 * (finish - start) / CLOCKS_PER_SEC << "秒" << endl;
}
int main() {
 list<int> l;
 vector<int> v;
 deque<int> d;
 joseph(l, 100000, 5);
 joseph(d, 100000, 5);
 joseph(v, 100000, 5);
 return 0;
}
#include <iostream>
#include <list>
using namespace std;
template<class T>
void exchange(list<T>& l1, typename list<T>::iterator p1, list<T>& l2, typename list<T>::iterator p2) {
 list<T> temp;
 temp.splice(temp.begin(), l1, p1, l1.end());
 l1.splice(l1.end(), l2, p2, l2.end());
 l2.splice(l2.end(), temp, temp.begin(), temp.end());
}
typedef list<int> INTLIST;
int main() {
 INTLIST l1, l2;
 for (int i = 0; i < 4; i++)
  l1.push_back(i);
 for (int i = 6; i < 12; i++)
  l2.push_back(i);
 INTLIST::iterator li;
 cout << "½»»»Ç°" << endl;
 cout << "l1: ";
 for (li = l1.begin(); li != l1.end(); li++)
  cout << *li << ' ';
 cout << endl;
 cout << "l2: ";
 for (li = l2.begin(); li != l2.end(); li++)
  cout << *li << ' ';
 cout << endl;
 INTLIST::iterator p1, p2;
 p1 = l1.begin();
 p2 = l2.begin();
 exchange(l1, ++(++p1), l2, ++p2);
 cout << "½»»»ºó" << endl;
 cout << "l1: ";
 for (li = l1.begin(); li != l1.end(); li++)
  cout << *li << ' ';
 cout << endl;
 cout << "l2: ";
 for (li = l2.begin(); li != l2.end(); li++)
  cout << *li << ' ';
 cout << endl;
 return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值