pub fn max_water_container(heights: &[i64]) -> i64Expand description
Eng ko’p suv sig’diradigan idish (container with most water).
Balandliklari berilgan ustunlardan ikkitasini tanlab, ular orasidagi
maksimal suv hajmini topamiz: hajm = min(h[i], h[j]) × (j − i).
G’oya: ikki chetdan boshlaymiz va pastroq devorni ichkariga suramiz — chunki uni qoldirib, kenglikni kamaytirish hech qachon foyda bermaydi.
- Time: O(n), Space: O(1).
§Misol
use rust_algorithms::other::two_pointers::max_water_container;
assert_eq!(max_water_container(&[1, 8, 6, 2, 5, 4, 8, 3, 7]), 49);
assert_eq!(max_water_container(&[1, 1]), 1);