update code

Author: Danieldu

StudyPlan/Graph/547.number-of-provinces.cpp renamed to Graph/547.number-of-provinces.cpp

@@ -0,0 +1,59 @@
+/*
+ * @lc app=leetcode id=2115 lang=cpp
+ *
+ * [2115] Find All Possible Recipes from Given Supplies
+ */
+
+// @lc code=start
+#include "bits/stdc++.h"
+using namespace std;
+class Solution {
+public:
+    vector<string> findAllRecipes(vector<string>& recipes, vector<vector<string>>& ingredients, vector<string>& supplies) {
+        
+        unordered_set<string> available(supplies.begin(), supplies.end());
+        unordered_map<string, vector<int>> dependents;
+        vector<int> missingCount(recipes.size(), 0);
+
+        for (int i = 0; i < recipes.size(); i++) {
+            for (const auto& ing : ingredients[i]) {
+                if (available.find(ing) == available.end()) {
+                    missingCount[i]++;
+                    dependents[ing].push_back(i);
+                }
+            }
+        }
+
+        queue<int> q;
+        vector<string> result;
+        for (int i = 0; i < recipes.size(); i++) {
+            if (missingCount[i] == 0) {
+                q.push(i);
+                result.push_back(recipes[i]);
+                available.insert(recipes[i]);
+            }
+        }
+        
+        while (!q.empty()) {
+            int curr = q.front();
+            q.pop();
+            string currRecipe = recipes[curr];
+
+            if (dependents.count(currRecipe)) {
+                for (int recId : dependents[currRecipe]) {
+                    missingCount[recId]--;
+
+                    if (missingCount[recId] == 0) {
+                        q.push(recId);
+                        result.push_back(recipes[recId]);
+                        available.insert(recipes[recId]);
+                    }
+                }
+            }
+        }
+        return result;
+    }
+};
+
+// @lc code=end
+

StudyPlan/Graph/695.max-area-of-island.cpp renamed to Graph/695.max-area-of-island.cpp

@@ -0,0 +1,43 @@
+/*
+ * @lc app=leetcode id=889 lang=cpp
+ *
+ * [889] Construct Binary Tree from Preorder and Postorder Traversal
+ */
+
+// @lc code=start
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
+ * };
+ */
+
+struct TreeNode {
+    int val;
+    TreeNode *left;
+    TreeNode *right;
+    TreeNode() : val(0), left(nullptr), right(nullptr) {}
+    TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
+    TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
+};
+#include "bits/stdc++.h"
+using namespace std;
+
+class Solution {
+public:
+    TreeNode* constructFromPrePost(vector<int>& preorder, vector<int>& postorder) {
+        TreeNode* root;
+        stack<int> stk;
+        for(int i=0;i<preorder.size();i++){
+            root = new TreeNode(preorder[i]);
+        }
+        return root;   
+    }
+};
+// @lc code=end
+