longestConsecutive.cpp

#include<vector>
#include<iostream>
#include<algorithm>
#include<set>

using namespace std;

class Solution
{
public:
    int longestConsecutive(vector<int> &nums)
    {
        //计数
        int count = 0;
        set<int> NoRepeatElemArr;
        vector<int> result;

        //去除相同元素
        for(int i = 0;i < nums.size();i++)
        {
            //防止出现相同元素
            if(NoRepeatElemArr.find(nums[i]) == NoRepeatElemArr.end())
            {
                NoRepeatElemArr.insert(nums[i]);
                result.push_back(nums[i]);
            }
        }

        //result便没有了重复元素

        for(int i = 0;i < result.size();i++)
        {
            for(int j = i + 1;j < result.size();j++)
            {
                if(result[j] - result[i] == 1)
                {
                    count++;
                }
                else
                {
                    continue;
                }
            }
        }

        return count;
    }
};

int main()
{
    string a = "😎";
    printf("%s",a.c_str());
}