[leetcode]581. Shortest Unsorted Continuous Subarray
来源:互联网 发布:淘宝灯笼是什么意思 编辑:程序博客网 时间:2024/05/16 10:38
题目链接:https://leetcode.com/problems/shortest-unsorted-continuous-subarray/#/description
iven 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 1:
Input: [2, 6, 4, 8, 10, 9, 15]Output: 5Explanation: You need to sort [6, 4, 8, 10, 9] in ascending order to make the whole array sorted in ascending order.
class Solution {public: int findUnsortedSubarray(vector<int>& nums) { int shortest = 0; int left = 0, right = nums.size() - 1; while (left < nums.size() - 1 && nums[left] <= nums[left + 1]) { left++; } while (right > 0 && nums[right] >= nums[right - 1]) { right--; }; if (right > left) { int vmin = INT32_MAX, vmax = INT32_MIN; for (int i = left; i <= right; ++i) { if (nums[i] > vmax) { vmax = nums[i]; } if (nums[i] < vmin) { vmin = nums[i]; } } while (left >= 0 && nums[left] > vmin) { left--; }; while (right < nums.size() && nums[right] < vmax) { right++; }; shortest = right - left - 1; } return shortest; }};
阅读全文
0 0
- [LeetCode]581. Shortest Unsorted Continuous Subarray
- leetcode 581. Shortest Unsorted Continuous Subarray
- [LeetCode]581. Shortest Unsorted Continuous Subarray
- [leetcode]581. Shortest Unsorted Continuous Subarray
- [leetcode]581. Shortest Unsorted Continuous Subarray
- 【LeetCode】581. Shortest Unsorted Continuous Subarray
- LeetCode 581. Shortest Unsorted Continuous Subarray
- [leetcode]: 581. Shortest Unsorted Continuous Subarray
- [LeetCode] 581. Shortest Unsorted Continuous Subarray
- [LeetCode] 581. Shortest Unsorted Continuous Subarray
- LeetCode 581. Shortest Unsorted Continuous Subarray
- LeetCode: 581. Shortest Unsorted Continuous Subarray
- leetcode 581. Shortest Unsorted Continuous Subarray
- LeetCode 581. Shortest Unsorted Continuous Subarray
- 【LeetCode】581. Shortest Unsorted Continuous Subarray
- [LeetCode] 581. Shortest Unsorted Continuous Subarray
- leetcode 581. Shortest Unsorted Continuous Subarray
- LeetCode-581. Shortest Unsorted Continuous Subarray
- 对于Spring AOP的理解
- leaflet可视化平台搭建
- HDU1208-Pascal's Travels(DP)
- C# 网络编程(TCP、UDP)
- Spring Web MVC
- [leetcode]581. Shortest Unsorted Continuous Subarray
- 【JavaSE系列-基础篇3】——面向对象编程概念之继承
- Struts2中StrutsPrepareAndExecuteFilter源码浅析
- jdbc hibernate(session) jpa (entityManager ) spring-data-jpa mybatis完全混用
- *最小生成树
- 测试人员使用idea+git查看代码逻辑
- RCNN总结
- 国际象棋棋盘
- 棋盘问题