classSolution{public:intfirstMissingPositive(vector<int>& nums){
vector<int>Array(nums.size(),-1);//原地哈希表容器for(int i =0; i < nums.size(); i++){if(nums[i]>0){
Array[nums[i]-1]= nums[i];}}for(int i =0; i < nums.size(); i++){if(Array[i]==-1){return(i+1);}}}};intmain(){
vector<int> nums={7,8,9,11,12};int k =0;
Solution s1;int ans = s1.firstMissingPositive(nums);
cout <<"zc is "<< ans << endl;return0;}