Merge pull request neetcode-gh#96 from UnresolvedCold/main

Updates and CPP codes

Author: neetcode-gh

cpp/102. Binary-Tree-Level-Order-Traversal.cpp renamed to cpp/102-Binary-Tree-Level-Order-Traversal.cpp

@@ -0,0 +1,18 @@
+class Solution {
+public:
+    int lastStoneWeight(vector<int>& stones) {
+        priority_queue<int, vector<int>> pq(stones.begin(), stones.end());
+        pq.push(0);
+        
+        while (pq.size()>=1) {
+            int t1 = pq.top();
+            pq.pop();
+            if(pq.empty()) break;
+            int t2 = pq.top();
+            pq.pop();
+            pq.push(abs(t1-t2));
+        }
+        
+        return pq.top();
+    }
+};

cpp/1046-Last-Stone-Weight.cpp

@@ -0,0 +1,8 @@
+class Solution {
+public:
+    int findKthLargest(vector<int>& nums, int k) {
+        priority_queue<int, vector<int>, greater<int>> pq(nums.begin(), nums.end());
+        while (pq.size() > k)pq.pop();
+        return pq.top();
+    }
+};

cpp/11- Container with most water.cpp renamed to cpp/11-Container-with-most-water.cpp

@@ -0,0 +1,28 @@
+/**
+ * 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) {}
+ * };
+ */
+class Solution {
+public:
+    
+    int MaxHeight(TreeNode* root, int& res) {
+        if (root == NULL) return 0;
+        int l = MaxHeight(root->left, res);
+        int r = MaxHeight(root->right, res);
+        res = max(res, max(max(l, r), l + r));
+        return 1 + max(l, r);
+    }
+    
+    int diameterOfBinaryTree(TreeNode* root) {
+        int breadth = 0;
+        MaxHeight(root, breadth);
+        return breadth;
+    }
+};

cpp/215-Kth-Largest-Element-in-an-Array.cpp

@@ -0,0 +1,26 @@
+class KthLargest {
+public:
+    priority_queue<int, vector<int>, greater<int>> pq;
+    int k;    
+    KthLargest(int k, vector<int>& nums) {
+        this->k = k;
+        for (auto a: nums) pq.push(a);
+        while(pq.size()>k){
+            pq.pop();
+        }
+    }
+    
+    int add(int val) {
+        pq.push(val);
+        while(pq.size()>k){
+            pq.pop();
+        }
+        return pq.top();
+    }
+};
+
+/**
+ * Your KthLargest object will be instantiated and called as such:
+ * KthLargest* obj = new KthLargest(k, nums);
+ * int param_1 = obj->add(val);
+ */