精简了最快的答案

Author: aQua

Algorithms/0041.first-missing-positive/first-missing-positive.go

@@ -6,14 +6,15 @@ import (
 
 func firstMissingPositive(nums []int) int {
 	for i := 0; i < len(nums); i++ {
-		index := nums[i] - 1
-		if nums[i] < 1 || nums[i] > len(nums) || index < 0 || index > len(nums) || nums[i] == i+1 {
-			// cannot swap or noused
-			continue
-		}
-		for nums[i] >= 1 && nums[i] <= len(nums) && nums[i] != nums[nums[i]-1] {
+
+		fmt.Println(i)
+
+		for 0 <= nums[i]-1 && nums[i]-1 < len(nums) && nums[i] != nums[nums[i]-1] {
+			//  0 <= nums[i]-1 && nums[i]-1 < len(nums) 是为了防止nums[nums[i]-1]溢出
 			nums[i], nums[nums[i]-1] = nums[nums[i]-1], nums[i]
+
 			fmt.Println(nums)
+
 		}
 	}
 

Algorithms/0041.first-missing-positive/first-missing-positive_test.go

@@ -29,6 +29,16 @@ func Test_Problem0041(t *testing.T) {
 
 	qs := []question{
 
+		question{
+			para{[]int{10, -1, 1, 2, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5, -3}},
+			ans{6},
+		},
+
+		question{
+			para{[]int{10, -1, 8, 6, 7, 3, -2, 5, 4, 2, 1, -3}},
+			ans{9},
+		},
+
 		question{
 			para{[]int{1}},
 			ans{2},