- Published on
Max Sum of Rectangle No Larger Than K
- Authors
- Name
- ShoxruxC
- @iOSdasturchi
📝 Vazifa tavsifi
Sizga m x n o'lchamli butun sonlardan iborat matrix va butun son k berilgan.
Matritsa ichidan yig'indisi ko'pi bilan k bo'lgan (ya'ni <= k) va yig'indisi bo'lishi mumkin bo'lgan eng katta to'rtburchakni toping. Natijada ana shu maksimal yig'indini qaytaring.
Shart shuki, har doim bunday yig'indiga ega bo'lgan kamida bitta to'rtburchak mavjud bo'ladi.
Misol:
Input: matrix = [[1,0,1],[0,-2,3]], k = 2
Output: 2
Tushuntirish: Eng katta yig'indiga ega bo'lgan to'rtburchak [[0, 1], [-2, 3]] dir va uning yig'indisi 0 + 1 - 2 + 3 = 2 ga teng. 2 <= 2.
Max Sum of Rectangle No Larger Than K
Qiyin50 daqiqa30 ball
📚 Misollar
Kiruvchi: matrix = [[1,0,1],[0,-2,3]], k = 2
Chiquvchi: 2
Kiruvchi: matrix = [[2,2,-1]], k = 3
Chiquvchi: 3
func solve(_ matrix: [[Int]], _ k: Int) -> Int {
// Kodingizni shu yerga yozing
return 0
}
Run tugmasini bosing