Merge pull request #670 from adherent9870/newm

first missing positve integer

Author: Sirajmolla

LeetCode/containerwithmostwater.cpp

@@ -0,0 +1,34 @@
+#include "bits/stdc++.h"
+using namespace std;
+int maxArea(int height[],int n) 
+    {
+        int i,j;
+        
+        i=0;
+        j=n-1;
+        int area = INT_MIN;
+        while(i<j)
+        {
+            area = max(area,min(height[i],height[j])*(j-i));
+            if(height[j]>height[i])
+            {
+                i++;
+            }
+            else
+            {
+                j--;
+            }
+        }
+        return area;
+    }
+int main(){
+    int n;
+    cin >>n;
+    int nums[n];
+    for(int i=0; i<n; i++){
+        cin >> nums[i] ;
+    }
+    int res=maxArea(nums,n);
+    cout<< res <<endl;
+    return 0;
+}

LeetCode/firstmissinginteger.cpp

@@ -0,0 +1,28 @@
+#include <iostream>
+using namespace std;
+int first(int nums[],int n) {
+    for (int j = 0; j < n - 1; j++){
+    if (nums[j] > nums[j + 1]){
+        int temp = nums[j];
+        nums[j] = nums[j + 1];
+        nums[j + 1] = temp;
+        j = -1;
+        }
+    }
+        int z=1;
+        for(int i=0; i<n; i++){
+            if(nums[i]==z){z++;}
+        } 
+        return z;
+}
+int main(){
+    int n;
+    cin >>n;
+    int nums[n];
+    for(int i=0; i<n; i++){
+        cin >> nums[i] ;
+    }
+    int res=first(nums,n);
+    cout<< res <<endl;
+    return 0;
+}