Eatswap
/
leetcode-daily
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

add: 221024-CN

This commit is contained in:
Eatswap 2022-10-24 09:11:13 +08:00
parent e24ac8a0f6
commit 53ad6bab78
Signed by: Eatswap
GPG Key ID: BE661106A1F3FA0B
2 changed files with 58 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

57
cpp/2210/221024-CN.cpp Normal file
View File

@ -0,0 +1,57 @@
#include <vector>
#include <iostream>
class Solution {
private:
static int partitionDisjoint_1(const std::vector<int>& nums) {
const int n = nums.size();
std::vector<int> max_until(n), min_since(n);
max_until[0] = nums[0];
min_since[n - 1] = nums[n - 1];
for (int i = 1; i < n; ++i)
max_until[i] = std::max(max_until[i - 1], nums[i]);
for (int i = n - 1; i--; )
min_since[i] = std::min(min_since[i + 1], nums[i]);
for (int i = 1; i < n; ++i)
if (max_until[i - 1] <= min_since[i])
return i;
return -1;
}
static int partitionDisjoint_2(const std::vector<int>& nums) {
const int n = nums.size();
std::vector<int> min_since(n);
min_since[n - 1] = nums[n - 1];
for (int i = n - 1; i--; )
min_since[i] = std::min(min_since[i + 1], nums[i]);
int max_until = nums[0];
for (int i = 1; i < n; ++i) {
if (max_until <= min_since[i])
return i;
max_until = std::max(max_until, nums[i]);
}
return -1;
}
public:
static int partitionDisjoint(const std::vector<int>& nums) {
const int n = nums.size();
std::vector<int> min_since(n);
min_since[n - 1] = nums[n - 1];
for (int i = n - 1; i--; )
min_since[i] = std::min(min_since[i + 1], nums[i]);
int max_until = 0;
for (int i = 1; i < n; ++i)
if ((max_until = std::max(max_until, nums[i - 1])) <= min_since[i])
return i;
return -1;
}
};
int main() {
std::cout << Solution::partitionDisjoint({1,1,1,0,6,12});
// todo: METRIC
return 0;
}

2
cpp/2210/CMakeLists.txt
View File

@ -3,4 +3,4 @@ PROJECT(2210)
SET(CMAKE_CXX_STANDARD 23)
ADD_EXECUTABLE(2210 221023.cpp)
ADD_EXECUTABLE(2210 221024-CN.cpp)