From 5341fdda8f36424b243a2ed02e4d3808d9924bda Mon Sep 17 00:00:00 2001 From: Eatswap Date: Mon, 24 Oct 2022 12:22:28 +0800 Subject: [PATCH] add: desc --- cpp/2210/221024-CN.cpp | 11 +++++++++++ 1 file changed, 11 insertions(+) diff --git a/cpp/2210/221024-CN.cpp b/cpp/2210/221024-CN.cpp index 1ab452d..bf4e2b2 100644 --- a/cpp/2210/221024-CN.cpp +++ b/cpp/2210/221024-CN.cpp @@ -1,6 +1,17 @@ #include #include +/** + * 915. Partition Array into Disjoint Intervals + * + * Given an integer array nums, partition it into two (contiguous) subarrays left and right so that: + * - Every element in left is less than or equal to every element in right. + * - left and right are non-empty. + * - left has the smallest possible size. + * Return the length of left after such a partitioning. + * Test cases are generated such that partitioning exists. + */ + class Solution { private: static int partitionDisjoint_1(const std::vector& nums) {