반응형
581. Shortest Unsorted Continuous Subarray

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given an integer array nums, 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. Return the shortest such subarray and output its length. Example 1: Input: nums = [2,6,4,8,10,9,15] Output: 5 Explanation: You need to sort [6, 4, 8, 10, 9] in ascending order to ..
Algorithm/LeetCode Daily Challenge 2022. 5. 13. 10:30
반응형
1