LeetCode //C - 1208. Get Equal Substrings Within Budget

1208. Get Equal Substrings Within Budget

You are given two strings s and t of the same length and an integer maxCost.

You want to change s to t. Changing the ith character of s to ith character of t costs |si - ti| (i.e., the absolute difference between the ASCII values of the characters).

Return the maximum length of a substring of s that can be changed to be the same as the corresponding substring of t with a cost less than or equal to maxCost. If there is no substring from s that can be changed to its corresponding substring from t, return 0.

Example 1:

Input: s = "abcd", t = "bcdf", maxCost = 3

Output: 3

Explanation: "abc" of s can change to "bcd".

That costs 3, so the maximum length is 3.

Example 2:

Input: s = "abcd", t = "cdef", maxCost = 3

Output: 1

Explanation: Each character in s costs 2 to change to character in t, so the maximum length is 1.

Example 3:

Input: s = "abcd", t = "acde", maxCost = 0

Output: 1

Explanation: You cannot make any change, so the maximum length is 1.

Constraints:
  • 1 < = s . l e n g t h < = 10 5 1 <= s.length <= 10^5 1<=s.length<=105
  • t.length == s.length
  • 0 < = m a x C o s t < = 10 6 0 <= maxCost <= 10^6 0<=maxCost<=106
  • s and t consist of only lowercase English letters.

From: LeetCode

Link: 1208. Get Equal Substrings Within Budget


Solution:

Ideas:

Use a sliding window: expand the right pointer while adding character costs, and shrink the left pointer whenever the total cost exceeds maxCost, tracking the maximum valid window length.

Code:
c 复制代码
#include <stdlib.h>

int equalSubstring(char* s, char* t, int maxCost) {
    int n = 0;
    while (s[n] != '\0') n++;

    int l = 0;
    int cost = 0;
    int ans = 0;

    for (int r = 0; r < n; r++) {
        cost += abs(s[r] - t[r]);

        while (cost > maxCost) {
            cost -= abs(s[l] - t[l]);
            l++;
        }

        int len = r - l + 1;
        if (len > ans) ans = len;
    }

    return ans;
}
相关推荐
H.莓飛11 小时前
【C++】【STL】stack_OJ题
服务器·c语言·开发语言·数据结构·c++·算法·visual studio
不会武功不懂江湖13 小时前
RISC-V链接器与链接脚本
汇编·算法·risc-v
Zwawa14 小时前
卡尔曼到底在算什么:从一维到它的变式以及工程版卡尔曼滤波算法C语言实现
c语言·算法·嵌入式
电科_银尘14 小时前
【大模型算法与工程 14】Tokenizer与Embedding:文本如何变成模型输入
算法·embedding
饮水桶_T15 小时前
Python 面向对象(十七)|继承、封装、多态 笔记
数据结构·笔记·算法
文丑颜不良啊17 小时前
LeetCode3281~3300题目解析
java·leetcode
地平线开发者18 小时前
让 AI Agent 和 征程6 台架高效、稳定、安全地协作
算法·安全·自动驾驶
kyle~19 小时前
SHA-256 哈希去重
算法·哈希算法
文丑颜不良啊20 小时前
LeetCode3261~3280题目解析
java·leetcode