摘要： 1.Longest Consecutive Sequence自动插入排序class Solution { public: int longestConsecutive(vector<int> &num) { map<int,int>hmap; hmap.clear(); int n = num.size(); for(int i=0; i<n; i++) { hmap[num[i]]=1; } int ans = 1; int max=1; ... 阅读全文