Container with most water Num 11: https://leetcode.com/problems/container-with-most-water/submissions/ 思路: 最大成水量决定因素:Min(num[i], num[j]) 和间距(j - i)决定。首尾指针,两者中值较小的向中间移动,用变量保存当前最大盛水量。矩阵理解,覆盖了全部可能的case。
class Solution {
public int maxArea(int[] height) {
if (height == null || height.length == 0 || height.length == 1) {
return 0;
}
int len = height.length;
int i = 0, j = len - 1;
int sum = 0;
int temp = 0;
while (i <= j) {
temp = Math.min(height[i], height[j]) * (j - i);
sum = Math.max(sum, temp);
if (height[i] >= height[j]) {
j--;
} else {
i++;
}
}
return sum;
}
}
3Sum Num 15: https://leetcode.com/problems/3sum/ 思路:排序;最外层循环遍历数组,内层首尾指针,和< 0, i增大,和==0,加入;和> 0, j减小。注意排除相同值,外层与前一个比较,相等跳过,内层和下一个比较,跳过。
public List<List<Integer>> threeSum(int[] nums) {
List<List<Integer>> result = new ArrayList<>();
if (nums == null || nums.length <= 2) {
return result;
}
int len = nums.length;
Arrays.sort(nums);
for (int i = 0; i < len-2; i++) {
if (i == 0 || (i > 0 && nums[i] != nums[i-1])) {
int lo = i+1, hi = nums.length-1, sum = 0 - nums[i];
while (lo < hi) {
if (nums[lo] + nums[hi] == sum) {
result.add(Arrays.asList(nums[i], nums[lo], nums[hi]));
while (lo < hi && nums[lo] == nums[lo+1]) lo++;
while (lo < hi && nums[hi] == nums[hi-1]) hi--;
lo++; hi--;
} else if (nums[lo] + nums[hi] < sum) lo++;
else hi--;
}
}
}
return result;
}
Search in Rotated Sorted Array Num 33: https://leetcode.com/problems/search-in-rotated-sorted-array/ 思路:二分查找,mid == 拐点,前后都有序;mid > 拐点,后面有序;mid < 拐点,前面有序
public int search(int[] nums, int target) {
if (nums == null || nums.length == 0) {
return -1;
}
int len = nums.length;
int low = 0, high = len - 1;
while (low <= high) {
int mid = (low + high) / 2;
if (nums[mid] == target) {
return mid;
}
if (nums[low] <= nums[mid]) { // left is sorted.
if (nums[low] <= target && nums[mid] >= target) {
high = mid - 1;
} else {
low = mid + 1;
}
continue;
} else { // right is sorted.
if (nums[mid] < target && nums[high] >= target) {
low = mid + 1;
} else {
high = mid - 1;
}
}
}
return -1;
}
Find First and Last Position of Element in Sorted Array Num 34: https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/ 思路:二分,相等条件下,移动两个指针。如果有相等的,则两者指针分别指向开始和结束。while条件nums[low] < nums[high]。
public int[] searchRange(int[] nums, int target) {
int[] result = {-1, -1};
if (nums == null || nums.length == 0) {
return result;
}
int low = 0, high = nums.length - 1;
while (nums[low] < nums[high]) {
int mid = low + (high - low)/2;
if (nums[mid] < target) {
low = mid + 1;
} else if (nums[mid] > target) {
high = mid - 1;
} else {
if (nums[low] == nums[mid]) {
high--;
} else {
low++;
}
}
}
if(nums[low] == nums[high] && nums[low] == target) {
result[0] = low;
result[1] = high;
}
return result;
}
Num 48: Rotate Image https://leetcode.com/problems/rotate-image/ 思路: 先转置(x, y)—> (y, x),在水平翻转(x, y) ----> (x, length - 1 - y)。 即(x, y) —> (y, length - 1 - x);
public void rotate(int[][] matrix) {
for(int i = 0; i < matrix.length; i++){
for(int j = i; j < matrix[0].length; j++){
int temp = 0;
temp = matrix[i][j];
matrix[i][j] = matrix[j][i];
matrix[j][i] = temp;
}
}
for(int i =0 ; i < matrix.length; i++){
for(int j = 0; j < matrix.length/2; j++){
int temp = 0;
temp = matrix[i][j];
matrix[i][j] = matrix[i][matrix.length-1-j];
matrix[i][matrix.length-1-j] = temp;
}
}
}
Num 162: Find Peak Element https://leetcode.com/problems/find-peak-element/ 思路:二分,从中间开始比较,可以减少比较次数。注意,头部和尾部的邻居只有一个。
public int findPeakElement(int[] nums) {
if (nums == null) {
return -1;
}
if (nums.length == 1) {
return 0;
}
return bs(nums, 0, nums.length - 1);
}
private int bs(int[] nums, int start, int end) {
while(start <= end){
int mid = start + (end - start)/2;
if(mid == 0){
if(nums[mid] > nums[mid+1]) return mid;
else start = mid +1;
}
else if(mid == nums.length-1 && nums[mid] > nums[mid-1]) return mid;
else if(nums[mid] > nums[mid-1] && nums[mid] > nums[mid+1]) return mid;
else if(nums[mid] > nums[mid-1]) start = mid+1;
else end = mid-1;
}
return -1;
}
Num 287. Find the Duplicate Number https://leetcode.com/problems/find-the-duplicate-number/ 思路:让每个数字放在自己的位置上,如果该位置有相同的数,则为重复数字
public int findDuplicate(int[] nums) {
for (int i = 0; i < nums.length; i++) {
while (nums[i] != i) {
if (nums[nums[i]] == nums[i]) {
return nums[i];
}
int tmp = nums[nums[i]];
nums[nums[i]] = nums[i];
nums[i] = tmp;
}
}
return -1;
}