[LeetCode] Sliding Windows

目录

1. Algorithmn Analysis

1.1 Implementation Template

1.2 Usual question variation

1.3 Complexity

2. Sliding Windows Optimization

3. Suitable Questions

3.1 substring without repeating characters

3.2 substring match

3.3 subarray

---

1. Algorithm Analysis

1. Create a window [left, right)
2. Increasing right edge to expand the window and update the matching results
3. if the window big enough, increasing left edge to shrink the window and update the result
4. Repeat step 2 and 3, until right edge reach end of input

1.1 Implementation Template

vector<int> letter(128,0);
for(auto c:target) {
    letter[c]++;
}

int l = 0, r = 0;
int matched = 0;
while(r < input.size()) {
    char c = input[r++]; //expend the window
    if(letter[c] > 0)
        matched++;
    letter[c]--; // non target char will be negative
    
    if(r-l == target.size()) { //condition to shrink the window
        if(matched == target.size())
            ans.push_back();
        //shrink window
        if(letter[input[l++]++ > 0)
            matched--;
    }
}

return and;

1.2 Usual question variation

1.2.1 longest subarray or substring

1.2.2 shortest subarray or substring

1.2.3 max/min median in a fixed window

1.3 Complexity

2. Sliding Windows Optimization

3. Suitable Questions

3.1 substring without repeating characters

3.2 substring match

3.3 subarray