From a09ca8d9c2a06882caaf1896d988843f38978cc1 Mon Sep 17 00:00:00 2001 From: mhrooz Date: Wed, 3 Jan 2024 11:26:20 +0800 Subject: [PATCH] 2610 simple --- 2610-20240102-pass/main.cpp | 59 +++++++++++++++++++++++++++++++++++++ 1 file changed, 59 insertions(+) create mode 100644 2610-20240102-pass/main.cpp diff --git a/2610-20240102-pass/main.cpp b/2610-20240102-pass/main.cpp new file mode 100644 index 0000000..ed98271 --- /dev/null +++ b/2610-20240102-pass/main.cpp @@ -0,0 +1,59 @@ +#include +using namespace std; +class Solution{ + public: + vector > findMatrix(vector& nums){ + sort(nums.begin(),nums.end(),greater()); + int max_cate = 1; + int cate = 1; + for(int i = 1 ; i < nums.size();i++){ + if(nums[i]==nums[i-1]) + cate++; + else{ + max_cate = max(max_cate,cate); + cate = 1; + } + } + max_cate = max(max_cate,cate); + vector > rlt(max_cate); + int cnt = 0; + while(cnt < nums.size() - 1){ + int cnt_in = 0; + rlt[cnt_in++].push_back(nums[cnt++]); + while(cnt ex1_nums = {1,3,4,1,2,3,1}; + vector >rlt1 = sol.findMatrix(ex1_nums); + for(int i = 0 ; i < rlt1.size();i++){ + for(int j = 0 ; j ex2_nums = {4,4,3}; + vector >rlt2 = sol.findMatrix(ex2_nums); + for(int i = 0 ; i < rlt2.size();i++){ + for(int j = 0 ; j