partition_disjoint.py

class Solution(object):
    def partitionDisjoint(self, A):
        """
        :type A: List[int]
        :rtype: int
        """
        if not A:
            return 0
        left = A[:1]
        right = A[1:]
        for _ in range(1, len(A)):
            if max(left) <= min(right):
                break
            else:
                left.append(right[0])
                del right[0]

        return(len(left))