first missing number leetcode
int firstMissingPositive(vector<int>& nums)
{
for(int i=0;i<nums.size();i++)
while(nums[i]>0 && nums[i]<=nums.size() && nums[nums[i]-1]!=nums[i])
swap(nums[i],nums[nums[i]-1]);
for(int i=0;i<nums.size();i++)
if(i+1!=nums[i])
return i+1;
return nums.size()+1;
}
Are there any code examples left?
New code examples in category C++
-
C++ 2023-04-28 17:44:25
-
C++ 2022-03-27 19:20:39 lists occurrences of characters in the string c++
-
C++ 2022-03-27 18:00:14 variabili in c++
-
C++ 2022-03-27 17:10:08 repeat character n times c++
-
C++ 2022-03-27 15:50:07 delete an array c++
-
C++ 2022-03-27 15:40:12 C++ pointer to base class
-
C++ 2022-03-27 12:15:21 find the graph is minimal spanig tree or not
-
C++ 2022-03-27 11:30:15 multi variable assignment cpp
-
C++ 2022-03-27 11:05:17 c++ pi float
-
C++ 2022-03-27 10:20:12 why exceptions can lead to memory leaks