/
githubmirror
/
hello-algo
Обзор
Документация
Войти
/
githubmirror
/
hello-algo
Код
Запросы
0
Пакеты
0
Релизы
0
Аналитика
Безопасность
main
en/codes/java/chapter_greedy/max_capacity.java
38 строк
1019 B
Yudong Jin
Translate all code to English (#1836)
31 дек 2025, 02:44
Не верифицирован
31 дек 2025, 02:44
2778a6f
Код
Авторство
О чём код?
/** * File: max_capacity.java * Created Time: 2023-07-21 * Author: krahets (krahets@163.com) */ package chapter_greedy; public class max_capacity { /* Max capacity: Greedy algorithm */ static int maxCapacity(int[] ht) { // Initialize i, j to be at both ends of the array int i = 0, j = ht.length - 1; // Initial max capacity is 0 int res = 0; // Loop for greedy selection until the two boards meet while (i < j) { // Update max capacity int cap = Math.min(ht[i], ht[j]) * (j - i); res = Math.max(res, cap); // Move the shorter board inward if (ht[i] < ht[j]) { i++; } else { j--; } } return res; } public static void main(String[] args) { int[] ht = { 3, 8, 5, 2, 7, 7, 3, 4 }; // Greedy algorithm int res = maxCapacity(ht); System.out.println("Maximum capacity is " + res); } }