[update] 581

Author: Dream

README.md

@@ -88,7 +88,7 @@
 |620|[Not Boring Movies](https://leetcode.com/problems/not-boring-movies/)| [Mysql](./algorithms/notBoringMovies/Solution.sql) |Easy|
 |617|[Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/)| [Java](./algorithms/mergeTwoBinaryTrees/Solution.java) |Easy|
 |595|[Big Countries](https://leetcode.com/problems/big-countries/)| [Mysql](./algorithms/bigCountries/Solution.sql) |Easy|
-|581|[Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray/) | |Easy|
+|581|[Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray/) | [Java_dream](./algorithms/shortestUnsortedContinuousSubarray/ShortestUnsortedContinuousSubarray.java) |Easy|
 |575|[Distrubute Candies](https://leetcode.com/problems/distribute-candies/)| [java](./algorithms/distributeCandies/Solution.java) |Easy|
 |572|[Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/) | |Easy|
 |563|[Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt/) | [java](./algorithms/binaryTreeTilt/Solution.java) |Easy|

algorithms/shortestUnsortedContinuousSubarray/ShortestUnsortedContinuousSubarray.java

@@ -0,0 +1,28 @@
+import java.util.Deque;
+import java.util.LinkedList;
+
+/**
+ * @author Dream
+ */
+public class ShortestUnsortedContinuousSubarray {
+    public int findUnsortedSubarray(int[] nums) {
+        Deque<Integer> que = new LinkedList<>();
+        int left = nums.length;
+        int right = 0;
+        boolean flag = false;
+        for (int i = 0; i < nums.length; i++) {
+            if (!que.isEmpty() && nums[i] < nums[que.getLast()]) {
+                int temp = que.getLast();
+                while (!que.isEmpty() && nums[i] < nums[que.getLast()]) {
+                    left = Math.min(left, que.pollLast());
+                }
+                que.addLast(temp);
+                right = i;
+                flag = true;
+            } else {
+                que.addLast(i);
+            }
+        }
+        return flag == true ? (right - left + 1) : 0;
+    }
+}