index.ts

/**
# 41. First Missing Positive

Given an unsorted integer array, find the smallest missing positive integer.

## Example

```bash
Input: [1,2,0]
Output: 3
```
```bash
Input: [3,4,-1,1]
Output: 2
```
```bash
Input: [7,8,9,11,12]
Output: 1
```

## Note

Your algorithm should run in O(n) time and uses constant extra space.
 */
exporttypeSolution=(nums: number[])=>number;

/**
 * 粗暴解法
 * @author yalda
 * @github https://github.com/guocaoyi/leetcode-ts
 */
exportconstfirstMissingPositive=(nums: number[]): number=>{
letcounter=1;
nums.sort((pre: number,next: number)=>pre-next);
for(leti=0;i<nums.length;i++){
if(nums[i]>counter){
counter++;
}else{
break;
}
}
returncounter;
};