每日学习笔记:C++ STL算法之容器元素变序
目录
reverse_copy(srcBeg, srcEnd, destEnd)
复制同时旋转:rotate_copy(srcBeg, srcNewBeg, srcEnd, destBeg)
next_permutation(beg, end, op)
prev_permutation(beg, end, op)
stable_partition(beg, end, op)
partition_copy(srcBeg, srcEnd, destTrueBeg, destFalseBeg, op)
反转元素次序
reverse(beg, end)
reverse_copy(srcBeg, srcEnd, destEnd)
旋转元素
旋转:rotate(beg, newBeg, end)
复制同时旋转:rotate_copy(srcBeg, srcNewBeg, srcEnd, destBeg)
对元素做排列组合情况列举与切换
next_permutation(beg, end)
next_permutation(beg, end, op)
prev_permutation(beg, end)
prev_permutation(beg, end, op)
使元素随机排序
shuffle(beg, end, eng)
random_shuffle(beg, end)
random_shuffle(beg, end, op)
将符合条件的元素排在前面
partition(beg, end, op)
stable_partition(beg, end, op)
将元素分符合条件的和不符合条件的分配到另外的两个容器里
partition_copy(srcBeg, srcEnd, destTrueBeg, destFalseBeg, op)
原文地址:https://blog.csdn.net/Jane_Yih/article/details/138013217
免责声明:本站文章内容转载自网络资源,如本站内容侵犯了原著者的合法权益,可联系本站删除。更多内容请关注自学内容网(zxcms.com)!