STL容器
文章平均质量分 78
「已注销」
这个作者很懒,什么都没留下…
展开
-
Deque-STL
Deque-STLDouble ended queue or Deque(part of C++ STL) are sequence containers with dynamic sizes that can be expanded or contracted on both ends (either its front or its back). The member functions原创 2017-10-30 08:44:55 · 496 阅读 · 0 评论 -
Lower Bound-STL
Lower Bound-STLYou are given integers in the sorted order. Then you are given queries. In each query you will be given an integer and you have to tell whether that integer is present in the array, i原创 2017-10-30 08:45:31 · 419 阅读 · 0 评论 -
Maps-STL
Maps-STLMaps are a part of the C++ STL.Maps are associative containers that store elements formed by a combination of a key value and a mapped value, following a specific order.The mainly used membe原创 2017-10-30 08:46:26 · 518 阅读 · 0 评论 -
Maximum Element——stack
Maximum ElementYou have an empty sequence, and you will be given queries. Each query is one of these three types:1 x -Push the element x into the stack.2 -Delete the element present at the t原创 2017-10-30 08:47:36 · 438 阅读 · 0 评论 -
Sets-STL
Sets-STLSets are a part of the C++ STL. Sets are containers that store unique elements following a specific order. Here are some of the frequently used member functions of sets:· Declaration:· s原创 2017-10-31 19:03:00 · 761 阅读 · 0 评论 -
Vector-Erase
Vector-EraseYou are given a vector of integers.Then you are given queries.First query consists of integer denoting the position in the vector which should be removed.Next query consists of integers原创 2017-10-31 19:03:58 · 368 阅读 · 0 评论 -
Vector-Sort
Vector-SortYou are given integers.Sort the integers and print the sorted order.Store the integers in a vector.Vectors are sequence containers representing arrays that can change in size.· Declar原创 2017-10-31 19:04:26 · 486 阅读 · 0 评论