leetcode

commit e6f15ec9044de2531e5dfb22d828ce0fb4c1d165
parent f3cf0b4447cb7faaf843b67a72839d90b2df78b4
Author: AndrewLockVI <andrewlaack1@gmail.com>
Date:   Sun,  9 Apr 2023 14:56:30 -0500

Missing number second submission

Diffstat:
D
missing-number/a.out
 | 
0

M
missing-number/missing-number.cpp
 | 
7
+++++++
A
missing-number/missing-numberV2.cpp
 | 
38
++++++++++++++++++++++++++++++++++++++

3 files changed, 45 insertions(+), 0 deletions(-)
diff --git a/missing-number/a.out b/missing-number/a.out
Binary files differ.
diff --git a/missing-number/missing-number.cpp b/missing-number/missing-number.cpp
@@ -3,6 +3,13 @@
 
 using namespace std;
 
+
+//Leet Ratings
+//       Speed  Memory
+//Total  23ms    18.6MB    
+//Beats  46.26%  8%
+
+
 int missingNumber(vector<int>& nums) {
 
     vector <int> num_seq(nums.size() + 1 , 0) ;
diff --git a/missing-number/missing-numberV2.cpp b/missing-number/missing-numberV2.cpp
@@ -0,0 +1,38 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+
+//Leet Ratings
+//       Speed  Memory
+//Total  18ms    17.9MB    
+//Beats  77.86%  94.74%
+
+
+
+int missingNumber(vector<int>& nums) {
+
+    vector <int> num_seq(nums.size() + 1 , 0) ;
+    for(int i = 0 ; i < nums.size() ; ++i){
+        num_seq[nums[i]] = 1;
+    }
+    for(int i = 0 ; i < num_seq.size() ; ++i){
+        if(num_seq[i] == 0){
+            return i;
+        }
+    }
+    return 0;
+}
+
+int main(){
+
+    vector <int> search_vec = {0, 1 , 2 ,3 ,4 ,6 , 7};
+    cout << missingNumber(search_vec) << " is the missing number from the list" <<  endl;
+
+}
+
+
+
+
+