-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
594.cpp
53 lines (50 loc) · 1.45 KB
/
594.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
__________________________________________________________________________________________________
sample 60 ms submission
static const auto fast = []() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0);
std::cout.tie(0);
return 0;
} ();
class Solution {
public:
int findLHS(std::vector<int>& nums) {
std::unordered_map<ssize_t, ssize_t> freq;
for (ssize_t i = 0; i < nums.size(); ++i) {
++freq[nums[i]];
}
ssize_t max = 0;
for (const auto& pair : freq) {
auto it = freq.find(pair.first + 1);
if (it != freq.end()) {
max = std::max(max, pair.second + it->second);
}
}
return max;
}
};
__________________________________________________________________________________________________
sample 12456 kb submission
class Solution {
public:
int findLHS(vector<int>& nums) {
if(nums.size()<2)
return 0;
int res=0,sum=0,j=0;
sort(nums.begin(),nums.end());
for(int i=0;i<nums.size()-1;i++)
{
sum=0;
j=i+1;
while(j<nums.size()&&nums[i]>=nums[j]-1)
{
sum++;
j++;
}
if(nums[j-1]>nums[i])
res=max(res,sum+1);
}
return res;
}
};
__________________________________________________________________________________________________