leetcode 581: Shortest Unsorted Continuous Subarray
来源:互联网 发布:音频剪辑软件mac版 编辑:程序博客网 时间:2024/06/05 22:44
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.
Note:
- Then length of the input array is in range [1, 10,000].
- The input array may contain duplicates, so ascending order here means <=.
public int findUnsortedSubarray(int[] nums) {ArrayList l = new ArrayList();for (int i = 0; i < nums.length; i++)l.add(nums[i]);l.sort(null);int sum = 0;int po_start = -1;int po_end = -2;for (int i = 0; i < nums.length; i++)if (nums[i] != (int) l.get(i))if (po_start == -1)po_start = i;elsepo_end = i;return po_end - po_start + 1;}
阅读全文
0 0
- leetcode 581: Shortest Unsorted Continuous Subarray
- 20170606-leetcode-581-Shortest Unsorted Continuous Subarray
- Leetcode 581 Shortest Unsorted Continuous Subarray
- leetcode 581 Shortest Unsorted Continuous Subarray
- 【Leetcode-Easy-581】Shortest Unsorted Continuous Subarray
- LeetCode.581 Shortest Unsorted Continuous Subarray
- leetcode 581[easy]---- Shortest Unsorted Continuous Subarray
- LeetCode Shortest Unsorted Continuous Subarray
- leetcode Shortest Unsorted Continuous Subarray
- leetCode-Shortest Unsorted Continuous Subarray
- 581 Shortest Unsorted Continuous Subarray
- LeetCode OJ 581 Shortest Unsorted Continuous Subarray [Easy]
- [LeetCode]581. 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
- 【LeetCode】581. Shortest Unsorted Continuous Subarray
- CodeForces
- JAVA-1043. 输出PATest(20)
- HDU—1596find the safest road(floyd算法模板题)
- c++实验6
- apt-get upgrade前,指定某些软件不更新
- leetcode 581: Shortest Unsorted Continuous Subarray
- POJ 1243 One Person 笔记
- 每天学一点Swift----函数(一)
- 一些崩溃原因
- DICOM UIDs
- java数据结构和算法-1,简单排序
- [Sicily]1402. Panic Room(week 16)
- MVP框架RecyclerView多种样式布局显示
- lnmp搭建(一) nginx安装配置