#include<iostream>
#include<cstdlib>
#include<string>
#include<string.h>
#include<algorithm>
#include<vector>
using namespace std;
struct ListNode{
int value;
ListNode *p_Next
};
void AddToTail(ListNode** pHead, int value){
ListNode* pNew = new ListNode();
pNew->value =value;
pNew->p_Next =NULL;
if(*pHead==NULL){
*pHead =pNew;
}
else{
ListNode* pNode = *pHead;
while(pNode->p_Next != NULL)
pNode=pNode->p_Next;
pNode->p_Next =pNew;
}
}
int main(){
return 0;
}
#include<iostream>
#include<list>
using namespace std;
void test1()
{
list<int> l;
list<int> l2(10,10);
list<int> l3(l2);
list<int> l4(l2.begin(),l2.end());
for(list<int>::iterator i=l4.begin();i!=l4.end();i++)
cout<<*i<<" ";
cout<<endl;
l.push_back(100);
l.push_back(200);
l.insert(l.begin(),300);
l.insert(l.end(),400);
list<int>::iterator it=l.begin();
it++;
it++;
l.insert(++l.begin(),500);
l.insert(it,1000);
for(list<int>::iterator i=l.begin();i!=l.end();i++)
cout<<*i<<" ";
cout<<endl;
l.pop_back();
l.pop_front();
l.erase(l.begin(),--l.end());
for(list<int>::iterator i=l.begin();i!=l.end();i++)
cout<<*i<<" ";
cout<<endl;
l.push_back(233);
l.push_back(200);
l.remove(200);
for(list<int>::iterator i=l.begin();i!=l.end();i++)
cout<<*i<<" ";
cout<<endl;
}
void test2(){
list<int> l;
l.assign(2,10);
list<int> l2;
l2.push_back(3);
l2.push_back(24);
l2.push_back(1);
l2.push_back(1);
l2.push_back(9);
list<int> l3;
l3=l;
l2.reverse();
for(list<int>::iterator i=l2.begin();i!=l2.end();i++)
cout<<*i<<" ";
cout<<endl;\
l2.reverse();
for(list<int>::iterator i=l2.begin();i!=l2.end();i++)
cout<<*i<<" ";
cout<<endl;
l2.sort();
for(list<int>::iterator i=l2.begin();i!=l2.end();i++)
cout<<*i<<" ";
cout<<endl;
}
void test3(){
list<int> l;
int a[5]={2,3,4,5,6};
l.assign(&a[1],&a[3]);
l.assign(a[1],a[3]);
for(list<int>::iterator i=l.begin();i!=l.end();i++)
cout<<*i<<" ";
cout<<endl;
}
bool count(int x,int y){
return x>y;
}
void test4(){
list<int> l;
int a[12]={2,3,4,5,6,6,3,24,7,1,3,2};
l.assign(&a[1],&a[9]);
for(list<int>::iterator i=l.begin();i!=l.end();i++)
cout<<*i<<" ";
cout<<endl;
l.sort(count);
for(list<int>::iterator i=l.begin();i!=l.end();i++)
cout<<*i<<" ";
cout<<endl;
}
int main(){
test4();
return 0;
}