solves maximum unsorted subarray

Author: anishLearnsToCode

Diff for: README.md

@@ -152,7 +152,7 @@
 | 566 | [Reshape The Matrix](https://leetcode.com/problems/reshape-the-matrix) | Easy | [![Java](assets/java.png)](src/ReshapeTheMatrix.java) [![Python](assets/python.png)](python/reshape_the_matrix.py) |
 | 572 | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree) | Easy | [![Java](assets/java.png)](src/SubtreeOfAnotherTree.java) [![Python](assets/python.png)](python/subtree_of_another_tree.py) |
 | 575 | [Distribute Candies](https://leetcode.com/problems/distribute-candies) | Easy | [![Java](assets/java.png)](src/DistributeCandies.java) [![Python](assets/python.png)](python/distribute_candies.py) |
-| 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) | Medium | [![Java](assets/java.png)](src/ShortestUnsortedContinuousSubarray.java) [![Python](assets/python.png)](python/shortest_continuous_unsorted_subarray.py) |
 | 589 | [N-Ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal) | Easy | |
 | 590 | [N-Ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal) | Easy | |
 | 594 | [Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence) | Easy | |

Diff for: python/shortest_continuous_unsorted_subarray.py

@@ -0,0 +1,12 @@
+from typing import List
+
+
+class Solution:
+    def findUnsortedSubarray(self, array: List[int]) -> int:
+        l, r, maximum, minimum = len(array), 0, array[0], array[-1]
+        for index, value in enumerate(array):
+            if value < maximum: r = index + 1
+            else: maximum = value
+            if array[len(array) - index - 1] > minimum: l = len(array) - 2 - index
+            else: minimum = array[len(array) - index - 1]
+        return max(0, r - l - 1)

Diff for: src/ShortestUnsortedContinuousSubarray.java

@@ -0,0 +1,12 @@
+public class ShortestUnsortedContinuousSubarray {
+    public int findUnsortedSubarray(int[] nums) {
+        int n = nums.length, l = n, r = 0, max = nums[0], min = nums[n - 1];
+        for (int i = 1; i < n; i++) {
+            if (nums[i] < max) r = i + 1;
+            else max = nums[i];
+            if (nums[n - 1 - i] > min) l = n - 1 - i - 1;
+            else min = nums[n - 1 - i];
+        }
+        return Math.max(0, r - l - 1);
+    }
+}