leetcode 1208. 尽可能使字符串相等

滑动窗口永远滴神

class Solution {
public:
int equalSubstring(string s, string t, int maxCost)
{
    vector<int>temp;
    for(int i=0;i<s.size();i++)
    {
        temp.push_back(abs(s[i]-t[i]));
    }
    int len=0;
    int cost=0;
    int left=0;
    int res=0;
    for(int right=0;right<temp.size();right++)
    {
        cost+=temp[right];
        len++;
        if(cost>maxCost)
        {
            cost-=temp[left];
            len--;
            left++;
        }
        res=max(res,len);
    }
    return res;
}
};

标签：right,1208,temp,int,res,len,cost,字符串,leetcode
来源： https://blog.csdn.net/qq_43180487/article/details/113703826