def lengthOfLIS(self, A):
        if not A:
            return 0

        n = len(A)
        MIN = [-1 for _ in xrange(n+1)]
        l = 1
        MIN[l] = 0
        for i in xrange(1,n):
            if A[i] > A[MIN[l]]:
                l += 1
                MIN[l] = i
            else:
                j = self.bin_search(MIN, A, A[i], 1, l+1)
                MIN[j] = i

        return l
The root password should not be "root". So we change it if it is.
dataset/ETHPy150Open algorhythms/LeetCode/300 Longest Increasing Subsequence.py/Solution.lengthOfLIS--crossover with--dataset/ETHPy150Open Bookworm-project/BookwormDB/bookwormDB/configuration.py/change_root_password_if_necessary