added Shorted Unsorted Continuous Subarray (easy)

Author: minhyeong-joe

Easy/ShortedUnsortedContinuousSubarray/README.md

@@ -0,0 +1,22 @@
+
+# Shortest Unsorted Continuous Subarray
+[Leetcode Link](https://leetcode.com/problems/shortest-unsorted-continuous-subarray/)
+
+## Problem:
+
+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 `<=`.

Easy/ShortedUnsortedContinuousSubarray/Solution.java

@@ -0,0 +1,32 @@
+import java.util.Arrays;
+
+// Sort array and check the length of unmatching subarray
+
+class Solution {
+ public int findUnsortedSubarray(int[] nums) {
+ int[] sorted = Arrays.copyOf(nums, nums.length);
+ Arrays.sort(sorted);
+ // System.out.println(Arrays.toString(sorted));
+ // System.out.println(Arrays.toString(nums));
+ int start = 0;
+ int end = 0;
+ // first difference is the start index of contiguous subarray
+ for (int i = 0; i < nums.length; i++) {
+ if (nums[i] != sorted[i]) {
+ start = i;
+ break;
+ }
+ }
+ // first difference from backwards is the end index of contiguous subarray
+ for (int i = nums.length - 1; i >= 0; i--) {
+ if (nums[i] != sorted[i]) {
+ end = i;
+ break;
+ }
+ }
+ // System.out.println(start);
+ // System.out.println(end);
+
+ return start != end ? end - start + 1 : 0;
+ }
+}

Easy/ShortedUnsortedContinuousSubarray/TestDriver.java

@@ -0,0 +1,11 @@
+import java.util.Arrays;
+
+class TestDriver {
+ public static void main(String[] args) {
+ Solution sol = new Solution();
+ int[] input = { 2, 6, 4, 8, 10, 9, 15 };
+ System.out.println("Input: " + Arrays.toString(input));
+ System.out.println("Output: " + sol.findUnsortedSubarray(input));
+ System.out.println();
+ }
+}

README.md

@@ -27,6 +27,7 @@ Languages used: Java and Python
  - [House Robber](Easy/HouseRobber)
  - [Majority Element](Easy/MajorityElement)
  - [Reshape the Matrix](Easy/ReshapeMatrix)
+ - [Shortest Unsorted Continuous Subarray](Easy/ShortedUnsortedContinuousSubarray)
 - Medium
  - [Minimum Add to Make Parentheses Valid](Medium/MinimumAddtoMakeParenthesesValid)
  - [Distribute Coins in Binary Tree](Medium/DistributionCoinsInBinaryTree)