human
I found an interesting problem on https://leetcode.com/problems/shortest-unsorted-continuous-subarray/:
Given an integer array, you need to find one continuous subarray that if you only sort this subarray in ascending order, then the whole array will be sorted in ascending order, too.  

You need to find the shortest such subarray and output its length.

Example 1:

Input: [2, 6, 4, 8, 10, 9, 15]
Output: 5
Explanation: You need to sort [6, 4, 8, 10, 9] in ascending order to make the whole array sorted in ascending order.


Note:

Then length of the input array is in range [1, 10,000].
The input array may contain duplicates, so ascending order here means .

I tried it in Python, but could not do it. Can you solve it?

 ... What is a Python code to find one continuous subarray that if you only sort this subarray in ascending order, then the whole array will be sorted in ascending order, too?
assistant
#Here is Python code to find one continuous subarray that if you only sort this subarray in ascending order, then the whole array will be sorted in ascending order, too.

class Solution:
     def findUnsortedSubarray(self, nums):
         """
         :type nums: List[int]
         :rtype: int
         """
         lens = len(nums)
         t = nums
         t = sorted(t)
         print(nums)
         t1 = lens
         t2 = 0
         for i in range(lens-1):
             if nums[i] != t[i]:
                 t1 = i
                 break
         for i in range(lens-1,0,-1):
             if nums[i] != t[i]:
                 t2 = i
                 break;
         print(t2)
         return max(t2-t1+1,0)