581. Shortest Unsorted Continuous Subarray
来源:互联网 发布:淘宝形象模特 编辑:程序博客网 时间:2024/05/01 15:46
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: 5Explanation: You need to sort [6, 4, 8, 10, 9] in ascending order to make the whole array sorted in ascending order.
code:
class Solution(object):
def findUnsortedSubarray(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
res=[]
nums2=sorted(nums)
if nums2==nums:return 0
for i in range(len(nums)):
if nums[i]!=nums2[i]:
res.append(i)
return max(res)-min(res)+1
阅读全文
0 0
- 581. Shortest Unsorted Continuous Subarray
- 581. Shortest Unsorted Continuous Subarray
- 581. Shortest Unsorted Continuous Subarray
- 581. Shortest Unsorted Continuous Subarray
- 581. Shortest Unsorted Continuous Subarray
- 581. Shortest Unsorted Continuous Subarray
- 581. Shortest Unsorted Continuous Subarray
- 581. Shortest Unsorted Continuous Subarray
- 581. Shortest Unsorted Continuous Subarray
- 581. Shortest Unsorted Continuous Subarray
- 581. Shortest Unsorted Continuous Subarray
- Shortest Unsorted Continuous Subarray
- Shortest Unsorted Continuous Subarray
- Shortest Unsorted Continuous Subarray
- [LeetCode]581. Shortest Unsorted Continuous Subarray
- leetcode 581. Shortest Unsorted Continuous Subarray
- [LeetCode]581. Shortest Unsorted Continuous Subarray
- [leetcode]581. Shortest Unsorted Continuous Subarray
- 腾讯云主机CentOS7.2系统搭建SVN服务器
- 微信小程序模块化开发框架
- 傅里叶变换
- Linux_Zookeeper 安装笔记
- IOS端K线系列之K线-绘制OHLC图、线段、圆形
- 581. Shortest Unsorted Continuous Subarray
- SharedPreferences存储
- 线程停止与守护进程--072
- 几个简单步骤可以提高网站浏览体验
- error: file '/boot/grub/i386-pc/normal.mod' not found解决办法
- 关于vc++6.0如何使用zlib.lib的问题解决
- jstree使用总结
- PartitionedPairBuffer
- 编译错误:ltdl.h: no such file