概述
基础知识:
栈:FILO,先进后出 https://blog.csdn.net/L_smartworld/article/details/105862717
队列:FIFO,先进先出 https://blog.csdn.net/L_smartworld/article/details/105841702
哈希表:主要用于统计和查询 https://blog.csdn.net/L_smartworld/article/details/105296110
1.自建数组作为哈希表,具有输入顺序性
2.map:底层为红黑树,有自动排序功能,默认按字典排序
3.unorder_map:STL中的哈希表,输入无序(完全乱序存储)
下面是力扣1~150题中出现的题:
博客索引:
1.两数之和:https://blog.csdn.net/L_smartworld/article/details/106491548
13.罗马数字转换成数字:https://blog.csdn.net/L_smartworld/article/details/106569345
20.有效的括号:https://blog.csdn.net/L_smartworld/article/details/106603875
30.串联所有单词的子串:https://blog.csdn.net/L_smartworld/article/details/106715445
32.最长有效括号:https://blog.csdn.net/L_smartworld/article/details/106733219
36.有效的数独:https://blog.csdn.net/L_smartworld/article/details/106793607
41.缺失的第一个正数:https://blog.csdn.net/L_smartworld/article/details/106854642
49.字母异位词分组:https://blog.csdn.net/L_smartworld/article/details/106930948
128.最长连续序列:https://blog.csdn.net/L_smartworld/article/details/107699306
146.LRU缓存机制:https://blog.csdn.net/L_smartworld/article/details/107761997
150.逆波兰表达式求值:https://blog.csdn.net/L_smartworld/article/details/107763526
剑指offer:
9.用两个栈实现队列:https://blog.csdn.net/L_smartworld/article/details/104394089
50.字符流中第一个不重复的字符:https://blog.csdn.net/L_smartworld/article/details/105441516
59.滑动窗口的最大值:https://blog.csdn.net/L_smartworld/article/details/105611761
最后
以上就是含蓄小虾米为你收集整理的leetcode之数据结构(哈希表,栈,队列,堆)总结(C++)的全部内容,希望文章能够帮你解决leetcode之数据结构(哈希表,栈,队列,堆)总结(C++)所遇到的程序开发问题。
如果觉得靠谱客网站的内容还不错,欢迎将靠谱客网站推荐给程序员好友。
发表评论 取消回复