练习1 Shortest Unsorted Continuous Subarray
来源:互联网 发布:淘宝怎么优化宝贝排名靠前 编辑:程序博客网 时间:2024/06/06 12:33
查找需要排序的最短子序列
题目:
给定一个整数数组,你需要找到一个连续的子阵。
你需要找到最短的子阵输出它的长度。
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.
//思路:将原数组序列进行排序形成新的数组,将新数组和原数组进行比较,从左边开始对比,当两个数值不一致时,返回该值位置序号
//从右边开始比较,当元素值不一样时,返回该序列号,预期值=右边的序列号-左边序列+1 ,即中间的长度就是需要进行排序的元素,输出其长度。
My
public int findUnsortedSubarray(int[] nums) {
int[] numsBySort = Arrays.copyOf(nums, nums.length);
Arrays.sort(numsBySort);
int left = 0;
int right =0;
int res = 0;
//不需要排序的情况下
if (Arrays.equals(nums, numsBySort)) {
return res;
}
for (int i = 0; i <nums.length; i++) {
if (nums[i]!=numsBySort[i]) {
if (i==nums.length-1) return nums.length;
left=i;
break;
}
}
for (int j = nums.length-1; j >0; j--) {
if (nums[j]!=numsBySort[j]) {
right=j;
break;
}
}
res=right-left+1;
return res;
}
other https://discuss.leetcode.com/topic/89282/java-o-n-time-o-1-space
publicintfindUnsortedSubarray(int[] A) {
int n = A.length, beg = -1, end = -2, min = A[n-1], max = A[0];
for (int i=1;i<n;i++) {
max = Math.max(max, A[i]);
min = Math.min(min, A[n-1-i]);
if (A[i] < max) end = i;
if (A[n-1-i] > min) beg = n-1-i;
}
return end - beg +1;
}
- 练习1 Shortest Unsorted Continuous Subarray
- Shortest Unsorted Continuous Subarray
- Shortest Unsorted Continuous Subarray
- Shortest Unsorted Continuous Subarray
- 581. Shortest Unsorted Continuous Subarray
- 581. Shortest Unsorted Continuous Subarray
- 581. Shortest Unsorted Continuous Subarray
- 581. Shortest Unsorted Continuous Subarray
- LeetCode Shortest Unsorted Continuous Subarray
- LeetCode581. Shortest Unsorted Continuous Subarray
- 581. Shortest Unsorted Continuous Subarray
- 581. Shortest Unsorted Continuous Subarray
- leetcode581. Shortest Unsorted Continuous Subarray
- leetcode Shortest Unsorted Continuous Subarray
- 581. Shortest Unsorted Continuous Subarray
- 581. Shortest Unsorted Continuous Subarray
- 581. Shortest Unsorted Continuous Subarray
- 581. Shortest Unsorted Continuous Subarray
- 用记事本编写第一个Java程序运行时 出现报错:错误: 类helloworld是公共的, 应在名为 helloworld.java 的文件中声明 public class helloworld {
- Lua技术总结
- 从零开始的JAVA之路.第二章
- 深入浅出MFC学习笔记(第6章 :MFC程序的生死因果)
- 工厂模式
- 练习1 Shortest Unsorted Continuous Subarray
- JAVA网络编程
- HTML学习笔记(Day4)
- 热修复框架Tinker最完整讲解(02)——加入Walle多渠道打包
- 润乾V5行式填报表自动插入空行
- 242. Valid Anagram
- 自解压winrar
- poj 1384 完全背包
- bzoj3884上帝与集合的正确用法 欧拉定理