Sync LeetCode submission - Shortest Unsorted Continuous Subarray (java)

thatbeautifuldream · thatbeautifuldream · commit e5e6e895929c · 2022-05-03T15:13:16.000Z
diff --git a/practice/problems/shortest_unsorted_continuous_subarray/solution.java b/practice/problems/shortest_unsorted_continuous_subarray/solution.java
@@ -0,0 +1,29 @@
+public class Solution {
+    public int findUnsortedSubarray(int[] nums) {
+        int min = Integer.MAX_VALUE, max = Integer.MIN_VALUE;
+        boolean flag = false;
+        for (int i = 1; i < nums.length; i++) {
+            if (nums[i] < nums[i - 1])
+                flag = true;
+            if (flag)
+                min = Math.min(min, nums[i]);
+        }
+        flag = false;
+        for (int i = nums.length - 2; i >= 0; i--) {
+            if (nums[i] > nums[i + 1])
+                flag = true;
+            if (flag)
+                max = Math.max(max, nums[i]);
+        }
+        int l, r;
+        for (l = 0; l < nums.length; l++) {
+            if (min < nums[l])
+                break;
+        }
+        for (r = nums.length - 1; r >= 0; r--) {
+            if (max > nums[r])
+                break;
+        }
+        return r - l < 0 ? 0 : r - l + 1;
+    }
+}
