标签：find make bsp http this only nbsp str mic
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: 5 Explanation: You need to sort [6, 4, 8, 10, 9] in ascending order to make the whole array sorted in ascending order.
Note:
class Solution { public int findUnsortedSubarray(int[] nums) { int [] tmp = new int[nums.length]; for(int i = 0; i < nums.length; i++){ tmp[i] = nums[i]; } int start = 0; int end = 0; Arrays.sort(nums); for(int i = 0; i<nums.length; i++){ if(nums[i]!=tmp[i]){ start = i; break; } } for(int k = nums.length-1; k>=0; k--){ if(nums[k]!=tmp[k]){ end = k; break; } } // System.out.println("Start "+start); // System.out.println("end "+end); if(start ==end && start ==0){ return 0; } return end-start+1; } }
581. Shortest Unsorted Continuous Subarray (LeetCode)
标签：find make bsp http this only nbsp str mic
原文地址：https://www.cnblogs.com/codingyangmao/p/11557755.html
