int longestLength = 0;

unordered_set<int> setNums(nums.begin(), nums.end());

while (!setNums.empty())

{

int num = *(setNums.begin());

int temp = num;

int left = 0, right = 0;

while (setNums.find(--temp) != setNums.end())

{

++left;

setNums.erase(temp);

}

temp = num;

while (setNums.find(++temp) != setNums.end())

{

++right;

setNums.erase(temp);

}

setNums.erase(num);

longestLength = max(longestLength, 1 + left + right);

}

return longestLength;