STL
STL
香蕉君
Heros come and go,but legends are forever.
展开
-
一颗二叉查找树的简单实现
第一次实现的二叉查找树,在别的大牛的博客学习了很久很久。发现由于其使用的技巧较多,不适用与新手模仿,所以自己实践写出了一个有局限性,功能专一化,不完整的二叉查找树。 使用了c++中的类来定义节点,并没有定义专门的树类,以减小代码复杂性。class BSTNode{ private: int key; BSTNode *原创 2017-03-20 12:09:08 · 281 阅读 · 0 评论 -
HDOJ1003
Problem Description Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5原创 2017-04-10 23:47:03 · 217 阅读 · 0 评论 -
UVa 156 STL之map的运用
Most crossword puzzle fans are used to anagrams — groups of words with the same letters in different orders — for example OPTS, SPOT, STOP, POTS and POST. Some words however do not have this attribu原创 2017-07-20 11:16:50 · 232 阅读 · 0 评论 -
UVa 540 STL之queue的运用
Queues and Priority Queues are data structures which are known to most computer scientists. The Team Queue, however, is not so well known, though it occurs often in everyday life. At lunch time the原创 2017-07-20 18:29:58 · 193 阅读 · 0 评论 -
UVa 12096 stl之stack
Background from Wikipedia: “Set theory is a branch of mathematics created principally by the German mathematician Georg Cantor at the end of the 19th century. Initially controversial, set theory h原创 2017-07-20 18:51:16 · 224 阅读 · 0 评论 -
UVa 1592 STL之map
Peter studies the theory of relational databases. Table in the relational database consists of values that are arranged in rows and columns. There are different normal forms that database may adhere原创 2017-07-22 16:53:05 · 209 阅读 · 0 评论