- 数组:
1.排序:#include<algorithm>
升序:
sort(arr,arr+10);
降序:
bool compare(int a,int b)
{
return a>b;
}//升序排列,如果改为return a>b,则为降序
sort(a,a+10,compare);
长度:
int n=(sizeof(arr) /sizeof(arr[0]));
- STL的架构图:
1. vector封装数组
2. list封装了链表
3. map和set封装了二叉树
STL之vector(2) https://blog.csdn.net/zhaoshuling1109/article/details/80487636
STL之set(集合)(3) https://blog.csdn.net/zhaoshuling1109/article/details/80489225
STL之stack(栈)(4) https://blog.csdn.net/zhaoshuling1109/article/details/80501171
STL只queue(队列)(5)https://blog.csdn.net/zhaoshuling1109/article/details/80501350