题解 | #最长无重复子数组#

滑动窗口法

class Solution {
public:
    /**
     * 
     * @param arr int整型vector the array
     * @return int整型
     */
    int maxLength(vector<int>& arr) {
        int start(0), end(0);
        int len(0), ans(0);
        while(end < arr.size()){
            for(int i = start; i < end; i++){
                if(arr[i]==arr[end]){
                    start = i+1;
                    len = end-start;
                    break;
                }
            }
            end++;
            len++;
            ans = max(ans,len);
        }
        return ans;
    }
};