You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
33 lines
634 B
33 lines
634 B
2 years ago
|
package class08;
|
||
|
|
|
||
|
|
// 本题测试链接 : https://leetcode.com/problems/container-with-most-water/
|
||
|
|
public class Code02_ContainerWithMostWater {
|
||
|
|
|
||
|
|
public static int maxArea1(int[] h) {
|
||
|
|
int max = 0;
|
||
|
|
int N = h.length;
|
||
|
|
for (int i = 0; i < N; i++) { // h[i]
|
||
|
|
for (int j = i + 1; j < N; j++) { // h[j]
|
||
|
|
max = Math.max(max, Math.min(h[i], h[j]) * (j - i));
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return max;
|
||
|
|
}
|
||
|
|
|
||
|
|
public static int maxArea2(int[] h) {
|
||
|
|
int max = 0;
|
||
|
|
int l = 0;
|
||
|
|
int r = h.length - 1;
|
||
|
|
while (l < r) {
|
||
|
|
max = Math.max(max, Math.min(h[l], h[r]) * (r - l));
|
||
|
|
if (h[l] > h[r]) {
|
||
|
|
r--;
|
||
|
|
} else {
|
||
|
|
l++;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return max;
|
||
|
|
}
|
||
|
|
|
||
|
|
}
|