【LeetCode】581.Shortest Unsorted Continuous Subarray(easy)解题报告
2017-11-07 23:33
483 查看
【LeetCode】581.Shortest Unsorted Continuous Subarray(easy)解题报告
题目地址:https://leetcode.com/problems/shortest-unsorted-continuous-subarray/description/
题目描述:
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:
Note:
题意:数组题,求不是正确顺序的中间部分数组长度。很多时候会考虑排序什么,解法一先排序,在比较,分别找到值不同的首尾index,得到长度。第二种解法借助单调栈。
Solution1:
Solution2:
Date:2017年11月7日
题目地址:https://leetcode.com/problems/shortest-unsorted-continuous-subarray/description/
题目描述:
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:
Input: [2, 6, 4, 8, 10, 9, 15] Output: 5 Explanation: You need to sort [6, 4, 8, 10, 9] in ascending order to make the whole array sorted in ascending order.
Note:
1. Then length of the input array is in range [1, 10,000]. 2. The input array may contain duplicates, so ascending order here means <=.
题意:数组题,求不是正确顺序的中间部分数组长度。很多时候会考虑排序什么,解法一先排序,在比较,分别找到值不同的首尾index,得到长度。第二种解法借助单调栈。
Solution1:
public class Solution{ public int findUnsortedSubarray(int[] nums){ int[] snums = nums.clone(); Arrays.sort(snums); int start = snums.length, end=0; for(int i=0 ; i<snums.length ; i++){ if(snums[i]!=nums[i]){ start = Math.min(start , i); end = Math.max(end,i); } } return (end - start>=0 ? end-start+1 : 0); } }
Solution2:
/* monotonic stack 单调栈 2 6 4 8 10 9 15 leftBound = Math.min(monotonic stack ops) rightBound shorts = rightBound - leftBound + 1 */ class Solution { public int findUnsortedSubarray(int[] nums) { if(nums.length<2){ return 0; } Stack<Integer> stack = new Stack<>(); int leftBound = nums.length-1, rightBound = 0; for(int i=0 ; i<nums.length ; i++){ if(stack.isEmpty() || nums[i]>= nums[stack.peek()]){ stack.push(i); }else{ leftBound = Math.min(leftBound,stack.pop()); i--; } } stack.clear(); for(int i=nums.length-1;i>=0;i--){ if(stack.isEmpty() || nums[i] <= nums[stack.peek()]){ stack.push(i); }else{ rightBound = Math.max(rightBound , stack.pop()); i++; } } return rightBound - leftBound > 0 ? rightBound - leftBound + 1 : 0; } }
Date:2017年11月7日
相关文章推荐
- 【LeetCode】226.Invert Binary Tree(Easy)解题报告
- 【LeetCode】637.Average of Levels in Binary Tree(Easy)解题报告
- 【LeetCode】189.Rotate Array(Easy)解题报告
- LeetCode解题报告 112. Path Sum [easy]
- 【LeetCode】206.Reverse Linked List(Easy)解题报告
- 【LeetCode】653.Two Sum IV - Input is a BST(Easy)解题报告
- 【LeetCode】599.Minimum Index Sum of Two Lists(Easy)解题报告
- 【LeetCode】108.Convert Sorted Array to Binary Search Tree(Easy)解题报告
- 【LeetCode】628.Maximum Product of Three Numbers(Easy)解题报告
- 【LeetCode】234.Palindrome Linked List(Easy)解题报告
- 【LeetCode】257.Binary Tree Paths(Easy)解题报告
- 【LeetCode】160.Intersection of Two Linked Lists(Easy)解题报告
- 【LeetCode】243.Shortest Word Distance(Easy)解题报告
- 【LeetCode】169. Majority Element(Easy)解题报告
- LeetCode解题报告 107. Binary Tree Level Order Traversal II [easy]
- LeetCode解题报告 102. Binary Tree Level Order Traversal [easy]
- [Leetcode] 581. Shortest Unsorted Continuous Subarray 解题报告
- 【LeetCode】217.Contains Duplicate(Easy)解题报告
- 【LeetCode】447.Number of Boomerangs(Easy)解题报告
- 【LeetCode】100.Same Tree(Easy)解题报告