题解 | #牧场里的编号顺序#

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param ids int整型vector 
     * @param n int整型 
     * @return int整型
     */
    int longestConsecutive(vector<int>& ids, int n) {
        // write code here
        int maxLen = 1;
        int lastLen = 1;
        if (ids.size() == 1) return 1;
        for (int i = 1; i < ids.size(); i++) {
            if (ids[i] > ids[i-1]) {
                maxLen = max(maxLen, lastLen+1);
                lastLen += 1;
            } else {
                lastLen = 1;
            }
        }
        return maxLen;
    }
};