45. [Application of list linked list]

[Insert a data in the header]

Function name.push_front()

[Insert a data at the end]

Function name.push_back()

【Multiple Insertion Data】

Function name.insert(function name.begin(),n) Where to start and who to insert

[Multiple Insertion Data 2]

Function name.insert(function name.begin(),n,m) Where to start, how many to insert, who to insert

[Insert using iterator]

iist::iterator object name;

Object name=function name.begin();

Function name.insert(object name, number, element)

[Delete the first element]

Function name.pop_front()

[Remove last element]

Function name.pop_back()

【Multiple delete data】

function name 1.erase(function name 1.begin(), function name 1.end()

[Linked list traversal can only be iterator traversal]

iist::iterator object name;

for(object name=function name.begin();object name!=end();object name++)

{

cout<<*object name;

}

#include

#include

using namespace std;

int main()

{

list list_a; //initialized to 0

int s[4] = { 2,5,8 };

list list_b(s, s + sizeof(s)/sizeof(int)); //Copy ordinary array to linked list

list_b.push_front(1); //Insert at the head

list_b.push_back(2); //Insert at the end

list_b.insert(list_b.begin(), 66); // where to insert, what to insert

list_b.insert(list_b.end(), 88);

list_b.insert(list_b.end(),3, 100); // where to insert, how many to insert, who to insert

list::iterator it; //Use the iterator Jinxin to insert

it = list_b.begin();

it++;

list_b.insert(it, 5, 111);

list_b.insert(list_b.begin(), s, s + sizeof(s) / sizeof(int)); //insert a normal array

list_b.pop_front(); //delete the first one

list_b.pop_back(); //delete the last one

//list_b.erase(list_b.begin(), list_b.end()); // delete from the beginning

list::iterator itor;

for (itor = list_b.begin(); itor!= list_b.end(); itor++)

{

cout << *itor << " ";

}

return 0;

}