数组练习(一)
1.盛最多水的容器https://leetcode.cn/problems/container-with-most-water/
package 盛水问题;import java.util.ArrayList; import java.util.List;public class Test01 {public static void main(String[] args) {int[] arr = {1,1};System.out.println(new Test01().maxArea(arr));}public int maxArea(int[] height){// 左int left = 0;// 右int right = height.length - 1;int max = 0;for (;left<right;){int minHeight = Math.min(height[left], height[right]);int width = right-left;int area = minHeight * width;max = Math.max(max,area);if(height[left] < height[right]){left++;}else{right--;}}return max;} }
. 三数之和https://leetcode.cn/problems/3sum/
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;public class ThreeSum {
public List<List<Integer>> threeSum(int[] nums) {
List<List<Integer>> result = new ArrayList<>();
Arrays.sort(nums);
for (int i = 0; i < nums.length - 2; i++) {
if (i > 0 && nums[i] == nums[i - 1]) {
continue;
}
int left = i + 1;
int right = nums.length - 1;
while (left < right) {
int sum = nums[i] + nums[left] + nums[right];
if (sum == 0) {
result.add(Arrays.asList(nums[i], nums[left], nums[right]));
while (left < right && nums[left] == nums[left + 1]) {
left++;
}
while (left < right && nums[right] == nums[right - 1]) {
right--;
}
// 移动双指针
left++;
right--;
} else if (sum < 0) {
left++;
} else {
right--;
}
}
}
return result;
}
public static void main(String[] args) {
ThreeSum solution = new ThreeSum();
// 测试用例1
int[] nums1 = {-1, 0, 1, 2, -1, -4};
System.out.println("测试用例1结果: " + solution.threeSum(nums1));
}
}