滑动窗口C语言

今日在做题的时候看到了一些关于滑动窗口的算法特分析如下：

代码分析如下：

 /* program start */
int lengthOfLongestSubstring(char * s){
    int maxValue = 0; // the max length of substring, to return
    int tempMaxValue = 0; // temp length 
```c
  /* use sliding window */
    int slidingWindowHead = 0; 
    int slidingWindowRear = 0;
    int slidingWindowQueue[128] = {0}; // ASCII of X86

    int length = strlen(s);

    if(length == 0)
    {
        return 0; // null string
    }

    while(slidingWindowHead <= (length - 1))
    {
        if(slidingWindowQueue[ s[slidingWindowHead] ] != 0) // find the same char
        {
            if(slidingWindowQueue[ s[slidingWindowHead] ] > slidingWindowRear) // ignore outer substring 
            {
                slidingWindowRear = slidingWindowQueue[ s[slidingWindowHead] ]; // refresh rear of sliding window
            }
        }

        tempMaxValue = slidingWindowHead - slidingWindowRear + 1; // equal to sliding window length

        if(tempMaxValue > maxValue) // refresh max length
        {
            maxValue = tempMaxValue;
        }

        slidingWindowQueue[ s[slidingWindowHead] ] = slidingWindowHead + 1; // store the [string char <-> position] in queue
        slidingWindowHead++;
    }

    return maxValue;
}

作者：hua-jia-wang-tie-nan
链接：https://leetcode-cn.com/problems/longest-substring-without-repeating-characters/solution/chun-c-hua-dong-chuang-kou-by-hua-jia-wang-tie-nan/
来源：力扣（LeetCode）
著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。