comefrom: <qiyuangong>581_Shortest_Unsorted_Continuous_Subarray_1.py
code: def findUnsortedSubarray( nums):
      snums = nums[::]
      snums.sort()
      start = len(nums)
      end = 0
      for i in range(len(nums)):
          if snums[i] != nums[i]:
              start = min(start, i)
              end = max(end, i)
      if end >= start:
          return end - start + 1
      return 0
masked: def sample_funcname ( var_0 ) :
      var_1 = var_0 [ : : ]
      var_1.sort ( )
      var_4 = len ( var_0 )
      var_6 = 0
      for var_8 in range ( len ( var_0 ) ) :
          if var_1 [ var_8 ] != var_0 [ var_8 ] :
              var_4 = min ( var_4 , var_8 )
              var_6 = max ( var_6 , var_8 )
      if var_6 >= var_4 :
          return var_6 - var_4 + 1
      return 0
  