ShortestUnsortedContinuousSubarray
来源:互联网 发布:淘宝上买枪会判刑么 编辑:程序博客网 时间:2024/06/13 00:30
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 <=.
思路:
要求这么一个子串,如果这个子串按升序排列好了,那么整个数组也升序排列好。我们只需要对数组进行一次排序保存到新数组中,然后比较新旧数组同一下标处的元素是否相同。一旦第一次出现不同就记录下来。可以分别得到首,尾两个元素的下标值i,j,那么所求子串的长度就是i-j+1.
import java.util.Arrays;public class ShortestUnsortedContinuousSubarray { public int findUnsortedSubarray(int[] nums) { int[] temp = Arrays.copyOf(nums, nums.length); Arrays.sort(temp); int i=0, j=temp.length-1; while(i<nums.length && nums[i] == temp[i]) i++; while(i<j && nums[j] == temp[j]) j--; return j-i+1; }}
阅读全文
0 0
- ShortestUnsortedContinuousSubarray
- 矩阵面积
- 云技术的应用让移动游戏大放异彩
- Html学习笔记2:基本格式、标签、超链接
- Spring boot—logback日志构建
- Chapter 8 基于实例的学习
- ShortestUnsortedContinuousSubarray
- 微信为什么更受欢迎?
- Xcode 9.0无线调试APP
- 16秋计算机JAVA第一节课作业(孙家伟)
- pix2code:从截图生成图形用户界面代码
- NIOS II 烧写epcs中遇到的问题
- Java 语言中 Synchronized 关键字的最致命误区
- C语言初步-第36讲: 用循环处理文字(有多少符号 )
- html之让横向ul内容居中