栈、队列、优先队列笔记

---

20. Valid Parentheses

---

150. Evaluate Reverse Polish Notation

---

71. Simplify Path

---

144. Binary Tree Preorder Traversal

---

94. Binary Tree Inorder Traversal

---

145. Binary Tree Postorder Traversal

---

341. Flatten Nested List Iterator

---

102. Binary Tree Level Order Traversal

// 此代码可以再更改，参看视频内容
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<vector<int>> levelOrder(TreeNode* root) {
        vector<vector<int>> result;
        if(!root)
            return result;
        int toBePrinted = 1;
        int nextLevel = 0;
        TreeNode* pCur = root;
        queue<TreeNode*> q;
        q.push(root);
        vector<int> v;
        while(!q.empty()){
            pCur = q.front();
            q.pop();
            v.push_back(pCur->val);
            --toBePrinted;
            if(pCur->left){
                q.push(pCur->left);
                ++nextLevel;
            }
            if(pCur->right){
                q.push(pCur->right);
                ++nextLevel;
            }
            if(!toBePrinted){
                result.push_back(v);
                v.clear();
                toBePrinted = nextLevel;
                nextLevel = 0;
            }
        }
        return result;
    }
};

---

107. Binary Tree Level Order Traversal II

---

103. Binary Tree Zigzag Level Order Traversal

---

199. Binary Tree Right Side View

---

BFS和图的最短路径

---

279. Perfect Squares
之前用动态规划做过
用图的最短路径解决一下

---

127. Word Ladder

---

126. Word Ladder II

---

优先队列的底层实现：堆
堆的底层实现：白板编程
priority_queue<int> 默认最大堆
priority_queue<int, vector<int>, greater<int>> // 最小堆
priority_queue<int, vector<int>, compare>

---

---

347. Top K Frequent Elements

---

23. Merge k Sorted Lists

---