leetcodeSolution to some Leetcode problems written in C++ |
git clone git://git.dimitrijedobrota.com/leetcode.git |
Log | Files | Refs | README | LICENSE |
2091.cpp (598B)
0 class Solution {
1 public:
2 int minimumDeletions(const vector<int> &nums) const {
3 const int n = size(nums);
4 int mini = nums[0], imini = 0;
5 int maxi = nums[0], imaxi = 0;
7 for (int i = 1; i < n; i++) {
8 if (mini > nums[i]) {
9 mini = nums[i];
10 imini = i;
11 }
13 if (maxi < nums[i]) {
14 maxi = nums[i];
15 imaxi = i;
16 }
17 }
19 return min(
20 {imini + n - imaxi + 1, imaxi + n - imini + 1, max(imini, imaxi) + 1, n - min(imini, imaxi)});
21 }
22 };