leetcode

Solution to some Leetcode problems written in C++

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

0128.cpp (476B)

0 class Solution { 1 public: 2 int longestConsecutive(vector<int> &nums) { 3 if (!nums.size()) return 0; 4 5 unordered_set<int> us(nums.begin(), nums.end()); 6 int res = 0; 7 8 for (int num : us) { 9 if (!us.count(num - 1)) { 10 int crnt = num; 11 while (us.count(crnt + 1)) 12 crnt += 1; 13 res = max(longestStreak, crnt - num); 14 } 15 } 16 17 return res + 1; 18 } 19 };