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

当寻找到字符串中有重复的字符出现，则退出该次检索；

class Solution {
public:
/**
*
* @param arr int整型vector the array
* @return int整型
*/
int maxLength(vector<int>& arr) {
// write code here</int>

    map<int,int> last;
    int ans = 0, now = 0;
    for (int i = 0; i < (int)arr.size(); ++i) last[arr[i]] = -1;
    for (int i = 0; i < (int)arr.size(); ++i) {
        if (last[arr[i]] != -1) now = max(now, last[arr[i]] + 1);
        ans = max(ans, i - now + 1);
        last[arr[i]] = i;
    }
    return ans;

}

};