Problem: 1608. 特殊数组的特征值耗时100%有序哈希表统计数字的频次然后依次放入数组中计算频次的后缀和若满足后缀和 tr[i].first且当前i0或者tr[i-1].first prefix[i]则返回Codeclass Solution { public: int specialArray(vectorint nums) { int n nums.size(); mapint, int mp; for(int i : nums) mp[i]; vectorpairint, int tr; for(auto [k, l] : mp) tr.push_back({k, l}); vectorint prefix((int)tr.size()1, 0); for(int i tr.size() - 1; i 0; i--) { prefix[i] prefix[i1] tr[i].second; if(prefix[i] tr[i].first (i0 || tr[i-1].first prefix[i])) return prefix[i]; } return -1; } };