![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
c++
songcy6202
软件工程学生一枚
展开
-
c++ 容器用法总结 转载。
C++中的容器大致可以分为两个大类:顺序容器和关联容器。顺序容器中有包含有顺序容器适配器。顺序容器:将单一类型元素聚集起来成为容器,然后根据位置来存储和访问这些元素。主要有vector、list、deque(双端队列)。顺序容器适配器:stack、queue和priority_queue。关联容器:支持通过键来高效地查找和读取元素。主要有:pair、set、map、multiset转载 2014-02-15 15:48:10 · 515 阅读 · 0 评论 -
LeetCode Decode Way
A message containing letters from A-Z is being encoded to numbers using the following mapping:'A' -> 1'B' -> 2...'Z' -> 26Given an encoded message containing digits, determine the total nu原创 2014-06-02 22:38:31 · 547 阅读 · 0 评论 -
LeetCode PathSum
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example:Given the below binary tree and sum原创 2014-06-03 17:53:35 · 436 阅读 · 0 评论 -
LeetCode Merge Intervals
Given a collection of intervals, merge all overlapping intervals.For example,Given [1,3],[2,6],[8,10],[15,18],return [1,6],[8,10],[15,18].一开始sb了 用数组记录原创 2014-06-04 18:30:47 · 404 阅读 · 0 评论 -
LeetCode Count and say
The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1 is read off as "one 1" or 11.11 is read off as "two 1s" or 21.21 is read off as原创 2014-06-13 17:23:46 · 700 阅读 · 0 评论