题解 | #数组中的最长连续子序列#
数组中的最长连续子序列
https://www.nowcoder.com/practice/eac1c953170243338f941959146ac4bf
class Solution { public: int MLS(vector<int>& arr) { sort(arr.begin(), arr.end()); int n = arr.size(); int count = 0; for (int i = 1; i < n; i++) { int j = i; int num = 1; while(j<n && arr[j]-arr[j-1]==1 || arr[j]==arr[j-1]) { if(arr[j]-arr[j-1]==1) { num++; } j++; } if(num>count) count = num; i = j; } return count; } };