46.单向链表

1 forward_list<int> list1{ 1,2,3,4,5 };

1 list1.sort();//排序

1 list1.push_front(10);

1 list1.reverse();

1 auto ib = list1.begin();

1 auto ib = list1.before_begin();

auto ib = list1.begin();
int a[5] = { 11,12,13,14,15 };
list1.insert_after(ib, 19);
list1.insert_after(ib, a, a + 5);

1 list1.erase_after(ib);

1 for (auto ib = list1.begin(), ie = list1.end(); ib != ie; ib++)
2 {
3     cout << *ib << endl;
4 }

1 list1.assign(10, 19);

1 forward_list<int> list1{ 1,2,3,4,5 };
2 forward_list<int> list2{ 1,2,3,4,5 };
3 list1.sort();//排序
4 list2.sort();
5 //合并
6 list1.merge(list2);