leetcode

0 class Solution {

1 public:

2 int findMaxK(const vector<int> &nums) const {

3 static uint8_t us[2001];

4 int res = -1;

5

6 memset(us, 0x00, sizeof(us));

7 for (const int n : nums) {

8 if (us[-n + 1000]) res = max(res, abs(n));

9 us[n + 1000] = 1;

10 }

11

12 return res;

13 }

14 };