- Published on
Get Equal Substrings Within Budget
- Authors
- Name
- ShoxruxC
- @iOSdasturchi
📝 Vazifa tavsifi
Sizga ikkita kichik ingliz harflaridan tuzilgan s va t satrlari, hamda butun son maxCost berilgan.
Siz s ni t ga aylantirmoqchisiz. i-chi belgini o'zgartirish xarajati |s[i] - t[i]| ga teng (belgilarning ASCII kodlari farqi).
Ko'pi bilan maxCost sarflagan holda s dan t ga o'zgartirish mumkin bo'lgan uzluksiz qism-satrning maksimal uzunligini toping.
Misol:
Input: s = "abcd", t = "bcdf", maxCost = 3
Output: 3
Tushuntirish: "abc" -> "bcd" uchun xarajat: |a-b| + |b-c| + |c-d| = 1+1+1 = 3. Maksimal uzunlik 3.
Get Equal Substrings Within Budget
O'rta25 daqiqa20 ball
📚 Misollar
Kiruvchi: s = "abcd", t = "bcdf", maxCost = 3
Chiquvchi: 3
Kiruvchi: s = "abcd", t = "cdef", maxCost = 3
Chiquvchi: 1
func solve(_ s: String, _ t: String, _ maxCost: Int) -> Int {
// Kodingizni shu yerga yozing
return 0
}
Run tugmasini bosing