Merge pull request #114 from Adarsh08X/master

Leetcode Problems

Author: larissalages

leetcode/cpp/Array/287.cpp

@@ -0,0 +1,16 @@
+class Solution {
+public:
+    int findDuplicate(vector<int>& nums) {
+        map<int,int> x;
+        int ans;
+        for(int i=0;i<nums.size();i++)
+        {
+           x[nums[i]]++;
+            if(x[nums[i]]>1)
+            {
+                ans=nums[i];
+            }
+        }
+        return ans;
+    }
+};

leetcode/cpp/Array/442.cpp

@@ -0,0 +1,15 @@
+class Solution {
+public:
+    vector<int> findDuplicates(vector<int>& nums) {
+        sort(nums.begin(),nums.end());
+        vector<int> ans;
+        for(int i=1;i<nums.size();i++)
+        {
+           if(nums[i]==nums[i-1])
+           {
+               ans.push_back(nums[i]);
+           }
+        }
+        return ans;
+    }
+};

leetcode/cpp/Tree/1305.cpp

@@ -0,0 +1,33 @@
+class Solution {
+public:
+            vector<int> v;
+    void tree1(TreeNode *root)
+    {
+        if(root!=NULL)
+        {
+            v.push_back(root->val);
+            tree1(root->left);
+             tree1(root->right);
+            
+        }
+    }
+    void tree2(TreeNode *root)
+    {
+        if(root!=NULL)
+        {
+            v.push_back(root->val);
+            tree2(root->left);
+             tree2(root->right);
+            
+        }
+    }
+    
+    vector<int> getAllElements(TreeNode* root1, TreeNode* root2) {
+
+        tree1(root1);
+        tree2(root2);
+        sort(v.begin(),v.end());
+        return v;
+        
+    }
+};