leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

1846.cpp (445B)

0 class Solution { 1 public: 2 int maximumElementAfterDecrementingAndRearranging(const vector<int> &arr) const { 3 static int count[100001]; 4 memset(count, 0x00, sizeof(count)); 5 6 const int n = size(arr); 7 for (const int num : arr) 8 count[min(num, n)]++; 9 10 int res = 1; 11 for (int num = 2; num <= n; num++) { 12 res = min(res + count[num], num); 13 } 14 return res; 15 } 16 };