581. Shortest Unsorted Continuous Subarray
来源:互联网 发布:python sftp 断点续传 编辑:程序博客网 时间:2024/05/22 06:11
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 <=.
Subscribe to see which companies asked this question.
public class Solution { public int findUnsortedSubarray(int[] nums) { int len = nums.length;int left = 0;int right = len - 1;while (left < len - 1) {if (nums[left] <= nums[left + 1])left++;elsebreak;}if (left == len - 1)return 0;while (right > 0) {if (nums[right] >= nums[right - 1])right--;elsebreak;}int min = nums[left];int max = nums[left];for (int i = left; i <= right; ++i) {if (nums[i] > max)max = nums[i];else if (nums[i] < min)min = nums[i];}int i = 0;int j = len - 1;while (i < left) {if (nums[i] <= min)i++;elsebreak;}while (j > right) {if (nums[j] >= max)j--;elsebreak;}return j - i + 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
- 面向对象编程--继承--类式继承
- tableview实现静态表格(纯代码)组头组尾实现
- 选举游戏(京东2016实习生真题)
- 【HDU1203】I NEED A OFFER!
- hadoop源码解析之hdfs读取数据全流程分析
- 581. Shortest Unsorted Continuous Subarray
- gitignore
- JS继承-构造函数式继承
- 鼠标点击页面中的任意标签,alert该标签的名称和 js实现点击<li>标签弹出其索引值
- 华为 路由器 防火墙设备路由转发原理
- vs2013中配置halcon13的步骤
- JS继承--组合继承
- C语言实现顺序队列的初始化、入队、出队等操作(三)
- tableview实现静态表格(xib版)