bugfix

Author: rachitiitr

LeetCode/41.first-missing-positive.cpp

@@ -5,7 +5,7 @@ class Solution {
     {
         int n = A.size();
         for(int i = 0; i < n; ++ i) {
-            while(A[i] >= 1 && A[i] <= n && A[i] != i+1)
+            while(A[i] >= 1 && A[i] <= n && A[i] != A[A[i]-1])
                 swap(A[i], A[A[i] - 1]);
         }