28/100. Shortest Unsorted Continuous Subarray
class Solution(object):
def findUnsortedSubarray(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
i = 0
j = len(nums)-1
newNums = sorted(nums)
while i<j:
if newNums[i] == nums[i]:
i += 1
else:
break
while j>=0:
if newNums[j] == nums[j]:
j -= 1
else:
break
return j-i+1 if (j-i+1)>0 else 0