def firstMissingPositive(self, A):
        if not A:
            return 1

        i = 0
        length = len(A)
        while i<length:
            current = A[i]
            if current<=0 or current>length or A[current-1]==current:  # out-of-range or in-place
                i += 1
            else:
                A[current-1], A[i] = current, A[current-1]   # go to the next iteration


        for i in xrange(length):
            if A[i]!=i+1:
                return i+1
        return A[-1]+1
dialogGetResponse()
dataset/ETHPy150Open algorhythms/LeetCode/040 First Missing Positive.py/Solution.firstMissingPositive--crossover with--dataset/ETHPy150Open brousch/sl4a_pydroid_mock_api/src/android/utils/androidhelper_r6.py/Android.dialogGetResponse