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