Day 40 算法笔记之STL 6.5 简单数据结构

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

int main(){
	
	queue<int> q;
	for(int i=1;i<=5;i++){
		q.push(i);
	}
	printf("%d %d\n",q.front(),q.back());
	
	return 0;
}

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

int main(){
	
	queue<int> q;
	for(int i=1;i<=5;i++){
		q.push(i);
	}
	for(int i=1;i<=3;i++){
		q.pop();
	}
	printf("%d\n",q.front());
	
	return 0;
}

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

struct fruit{
	string name;
	int price;
	friend bool operator < (fruit a,fruit b){
		return a.price>b.price;
	}
}a,b;

int main(){
	
	priority_queue<fruit> q;
	a.name="cao";
	a.price=5;
	b.name="xiao";
	b.price=8;
	q.push(a);
	q.push(b);
	cout<<q.top().name<<" "<<q.top().price<<endl;
	
	
	return 0;
}

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


int main(){
	
	stack<int> st;
	for(int i=1;i<5;i++){
		st.push(i);
	}
	printf("%d\n",st.top());

	
	return 0;
}

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

int main(){

	pair<string,int> p;
	p.first = "caoxiaoqin";
	p.second = 250;
	cout<<p.first<<" "<<p.second<<endl;
	
	p = make_pair("xiaoxiao",520);
	cout<<p.first<<" "<<p.second<<endl;
	
	p = pair<string,int>("xiaoxiao",5201314);
	cout<<p.first<<" "<<p.second<<endl;
	
	return 0;
}

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

int main(){
	
	pair<int,int> a(5,10);
	pair<int,int> b(6,4);
	pair<int,int> c(6,10);
	
	if(b<c) printf("%d",b.second);
	
	return 0;
}

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

int main(){
	
	map<string,int> mp;
	mp.insert(make_pair("xiaoxiao",15));
	mp.insert(pair<string,int>("caoxia",2));
	for(map<string,int>::iterator it=mp.begin();it!=mp.end();it++){
		cout<<it->first<<" "<<it->second<<endl;
	}
	
	return 0;
}

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

int main(){
	
	int x=1,y=-2;
	swap(x,y);
	cout<<x<<" "<<y<<endl;
	
	return 0;
}

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

int main(){
	
	int a[5] = {1,2,3,4,5};
	reverse(a,a+5);
	
	for(int i=0;i<5;i++){
		printf("%d ",a[i]);
	}
	
	return 0;
}

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

int main(){
	
	int a[10] = {1,2,3,4,5,6,7,8,9,10};
	fill(a,a+5,9);
	for(int i=0;i<10;i++){
		printf("%d ",a[i]);
	}
	
	return 0;
}

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

bool cmp(string a,string b){
	return a.length()<b.length();
}

int main(){
	
	int a[5] = {1,2,3,4,5};
	int *x=lower_bound(a,a+5,3);
	int *y=upper_bound(a,a+5,3);
	printf("%d %d",x-a,y-a);
	return 0;
}