#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