其他

一般來說，數實值型別的極值是一個與平台相關的特性。c++標準程式庫通過template

#include<iostream>#include<string>using namespace std;class Person{public: Person(string name,int age){  this->name=name;  this->age=age; } void show(){  cout<<name<<" "<<age<<endl; } void

代碼如下：#include<iostream>#include<algorithm>#include<string>#include<vector>#include<functional>using namespace std;int main(){vector<int>v;for(int i=0;i<10;++i){v.push_back(i);}replace(v.begin(),v.end(),5,555); /

c++標準程式庫提供了數個預先定義的特殊迭代器，也叫做迭代器適配器，它們不僅起輔助作用，還能賦予整個迭代器抽象概念更加強大的能力。雖然我的前面一下部落格有講到幾種迭代器的適配，但是講的比較零散，今天翻起STL標準庫，想在這裡總結一下：迭代器有三種適配器1 Insert iterator（插入迭代器）2 Stream iterator（流迭代器）3 Reverse

直接代碼如下：//heap演算法#include<iostream>#include<string>#include<vector>#include<algorithm>#include<functional>using namespace std;int main(){int a[]={7,4,1,8,5,2,9,6,3,8};vector<int>v(a,a+10);make_heap(v.begin(),v.end()

所謂“排序準則”，必須定義strict weak ordering,其意義如下1必須是“反對稱的（antisymmetric）”對operator<而言，如果x<y為真，則y<x為假對判斷式predicate op()而言，如果op(x,y)為真，則op(y,x)為假2必須是“可傳遞的（transitive）”對operator<而言，如果x<y為真且y<z為真，則x<z為真對判斷式predicate op()而言，如果op(x,y)為真且op(y,z)

直接代碼如下：//includes#include<iostream>#include<string>#include<vector>#include<algorithm>#include<functional>using namespace std;bool jiayibijiao(int a,int b){return a==b;}int main(){int a[]={1,2,3,4,5,6,7,8,9,10};int b[]={

比較簡單，所以沒有注釋。#include<iostream>#include<set>#include<algorithm>#include<functional>using namespace std;int main(){set<int,greater<int>

直接代碼：//局部排序 partial_sort partial_sort_copy#include<iostream>#include<string>#include<vector>#include<algorithm>#include<functional>using namespace std;int main(){int a[]={1,4,7,2,5,8,3,6,9,10};vector<int>v(a,a+10)

直接代碼：//set_union#include<iostream>#include<string>#include<vector>#include<string>#include<algorithm>#include<functional>using namespace std;bool fanxu(int a,int b){return a<b;}int main(){int a[]={1,2,2,4,6,7,7,

直接貼代碼：基礎的東西，不解釋#include<iostream>#include<string>#include<map>using namespace std;int

各種演算法，近日得閑，敲了一下：看演算法名稱，也大概能猜出這個演算法是做什麼的，因此，看一下例子就算了，不解釋了；#include<iostream>#include<string>#include<vector>#include<algorithm>#include<functional>using namespace std;int main(){int

代碼如下：#include<iostream>#include<string>#include<vector>#include<algorithm>#include<functional>using namespace std;int main(){int a[]={1,2,3,4,5,6,7,8,9,10};vector<int>v(a,a+10);vector<int>::iterator

1建立anmial.h檔案：#ifndef ANIMAL_H#define ANIMAL_Hclass animal{public: animal(); void eat(); void sleep();private:};#endif2建立fish.h檔案：#ifndef FISH_H#define FISH_H#include"animal.h"class fish :public animal{public: fish(); void

http://blog.csdn.net/wop_niaoren19870227/article/details/7239255“點九”的製作方法方法1：使用

stack堆棧，沒有迭代器，支援push()方法。後進先出,top()返回最頂端的元素,pop()剔除最頂元素deque雙端隊列，支援迭代器，有push_back()方法，跟vector差不多，比vector多了個pop_front,push_front方法queue隊列，先進先出，不支援迭代器，有push()方法，pop()剔除第一個元素,front()返回第一個元素代碼如下：#include<iostream>#include<stack>#include<st

直接代碼如下：//數值計算//accumulate#include<iostream>#include<string>#include<algorithm>#include<numeric>#include<functional>#include<vector>using namespace std;int main(){int a[]={1,2,3,4,5,6,7,8,9,10};vector<int>v(a,

#include<iostream>#include<string>#include<cstddef>#include<functional>#include<algorithm>using namespace std;template<typename T,std::size_t thesize>class carray{private:T v[thesize];public:typedef T

clock是用來計時的，精確到ms層級clock()在<ctime>標頭檔，傳回值為clock_t就一個超大整形，下面是一個例子，電腦迴圈的時間#include<iostream>#include<string>#include<ctime>using namespace std;int main(){  clock_t start,finsh; start=clock(); for(int

命名空間：#include<iostream>#include<string>using namespace std;namespace zhang{ void show(){  cout<<"hello,welcome to use namespace zhang"<<endl; }}namespace li{ void showtoo(){  cout<<"use namespace rencheng