079. Maximum Unsorted Subarray.py

# Maximum Unsorted Subarray
"""
You are given an array (zero indexed) of N non-negative integers, A0, A1 ,…, AN-1.

Find the minimum sub array Al, Al+1 ,…, Ar so if we sort(in ascending order) that sub array, then the whole array should get sorted.

If A is already sorted, output -1.

Example :

Input 1:

A = [1, 3, 2, 4, 5]

Return: [1, 2]

Input 2:

A = [1, 2, 3, 4, 5]

Return: [-1]
In the above example(Input 1), if we sort the subarray A1, A2, then whole array A should get sorted.
"""
class Solution:
    # @param A : list of integers
    # @return a list of integers
    def subUnsort(self, A):
        B = sorted(A)
        out = []
        if A == B:
            return [-1]
        # print(A,B)
        for i in (range(len(A))):
            if A[i] == B[i]:
                continue
            out.append(i)
        return [min(out),max(out)]