一,栈:
1,Valid Parentheses(有效的括号)
英文版:https://leetcode.com/problems/valid-parentheses/
中文版:https://leetcode-cn.com/problems/valid-parentheses/
2,Longest Valid Parentheses(最长有效的括号)
英文版:https://leetcode.com/problems/longest-valid-parentheses/
中文版:https://leetcode-cn.com/problems/longest-valid-parentheses/
3,Evaluate Reverse Polish Notatio(逆波兰表达式求值)
英文版:https://leetcode.com/problems/evaluate-reverse-polish-notation/
中文版:https://leetcode-cn.com/problems/evaluate-reverse-polish-notation/
二,队列:
1, Design Circular Deque(设计一个双端队列)
英文版:https://leetcode.com/problems/design-circular-deque/
中文版:https://leetcode-cn.com/problems/design-circular-deque/
2, Sliding Window Maximum(滑动窗口最大值)
英文版:https://leetcode.com/problems/sliding-window-maximum/
中文版:https://leetcode-cn.com/problems/sliding-window-maximum/
三,链表:
1,Linked List Cycle I(环形链表)
英文版:https://leetcode.com/problems/linked-list-cycle/
中文版:https://leetcode-cn.com/problems/linked-list-cycle/
2,Merge k Sorted Lists(合并 k 个排序链表)
英文版:https://leetcode.com/problems/merge-k-sorted-lists/
中文版:https://leetcode-cn.com/problems/merge-k-sorted-lists/
其中,第一个更Pythonic,但会超时。
Reference:
Leetcode-20:https://blog.csdn.net/weixin_39232863/article/details/85231829;
Leetcode-32:https://blog.csdn.net/u014626513/article/details/81285602;
Leetcode-150:https://blog.csdn.net/qq_17550379/article/details/80724563;
Leetcode-641: https://blog.csdn.net/fuxuemingzhu/article/details/81027989;
Leetcode-239:https://blog.csdn.net/qq_28327765/article/details/86524835;
Leetcode-141:
https://www.cnblogs.com/GF66/p/9785470.html;
Leetcode-23:https://blog.csdn.net/qq_32806793/article/details/83345845;
https://blog.csdn.net/qdbszsj/article/details/77932349
本文分享自 MiningAlgorithms 微信公众号,前往查看
如有侵权,请联系 cloudcommunity@tencent.com 删除。
本文参与 腾讯云自媒体同步曝光计划 ,欢迎热爱写作的你一起参与!