[leetcode笔记] Longest Consecutive Sequence

 1 class Solution {
 2 public:
 3     int longestConsecutive(vector<int> &num) {
 4         //cc_print_int_vector(num);
 5         sort(num.begin(), num.end());
 6         //cc_print_int_vector(num);
 7 
 8         int longest = 0;
 9 
10         int i = 0, j = 0;
11         bool breakFlag = false;
12         for(i = 0; i<num.size() - 1; i++)
13         {
14             for(j = i +1; j<num.size(); j++)
15             {
16                 if(num[j-1]+1 != num[j])
17                 {
18                     int distance = j - i;
19                     if( distance > longest)
20                     {
21                         longest = distance;
22                     }
23                     breakFlag = true;
24                     break;
25                 }
26             }
27             if (breakFlag)
28             {
29                 i = j+1;
30                 breakFlag = false;
31                 continue;
32             }
33         }
34 
35         return longest;
36     }
37 };