missing-number.cpp (619B)
1 #include <iostream> 2 #include <vector> 3 4 using namespace std; 5 6 7 //Leet Ratings 8 // Speed Memory 9 //Total 23ms 18.6MB 10 //Beats 46.26% 8% 11 12 13 int missingNumber(vector<int>& nums) { 14 15 vector <int> num_seq(nums.size() + 1 , 0) ; 16 for(int i = 0 ; i < nums.size() ; ++i){ 17 num_seq[nums[i]] = 1; 18 } 19 for(int i = 0 ; i < num_seq.size() ; ++i){ 20 if(num_seq[i] == 0){ 21 return i; 22 } 23 } 24 return 0; 25 26 } 27 28 29 30 31 int main(){ 32 33 vector <int> search_vec = {0, 1 , 2 ,3 ,4 ,6 , 7}; 34 cout << missingNumber(search_vec) << " is the missing number from the list" << endl; 35 36 } 37 38 39 40 41