leetcode Shortest Unsorted Continuous Subarray

581. Shortest Unsorted Continuous Subarray

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:

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 <=.

public class Solution {

    public static int findUnsortedSubarray(int[] nums) {
        int[] temp = new int[nums.length];
        for(int i=0; i<nums.length; i++){
        temp[i] = nums[i];
        }
        java.util.Arrays.sort(temp);
        ArrayList alist = new ArrayList();
        for(int i=0; i<nums.length; i++){
        if(temp[i] != nums[i]){
        alist.add(i);
        }
        }
        int l = 0;
        if(alist.size() != 0){
        l = (int)alist.get(alist.size()-1) - (int)alist.get(0) + 1;
        }
        return l;
    }
public static void main(String args[]){
Scanner reader = new Scanner(System.in);
String d = reader.next();
String[] n = d.substring(1, d.length()-1).split(",");
int[] nums = new int[n.length];
for(int i=0; i<nums.length; i++){
nums[i] = Integer.parseInt(n[i]);
}
   System.out.print(findUnsortedSubarray(nums));
}

}

这个运行时间过长，还需完善。

参考：

Scanner读取数组：http://gufeng99.lofter.com/post/1d146f3d_69c623b

动态数组：http://blog.csdn.net/hugeheadhuge/article/details/6535235