二分法训练:LeetCode 35 搜索插入位置
public int searchInsert(int[] nums, int target) {
int n = nums.length;
int left=0;
int right = n-1;
while(left<=right){
int mid = left + (right-left)/2;
if(nums[mid]>target){
right = mid-1;
}else if(nums[mid]<target){
left = mid+1;
}else{
return mid;
}
}
return left;
}
二分法训练:LeetCode 34 在排序数组中查找元素的第一个位置和最后一个位置
利用两次二分分别查找start和end,start和end初始化为-1,在每次遇到target值时:
1. 对于start,将right改为mid-1继续二分直至left>right
2. 对于end,将left改为mid+1继续二分直至left>right
public int[] searchRange(int[] nums, int target) {
int n = nums.length;
int left=0;
int right = n-1;
int start=-1;
int end = -1;
while(left<=right){
int mid = left+(right-left)/2;
if(nums[mid]>target){
right = mid-1;
}else if(nums[mid]<target){
left = mid+1;
}else{
start = mid;
right = mid-1;
}
}
left=0;
right = n-1;
while(left<=right){
int mid = left+(right-left)/2;
if(nums[mid]>target){
right = mid-1;
}else if(nums[mid]<target){
left = mid+1;
}else{
end = mid;
left = mid+1;
}
}
int []res = new int [2];
res[0] = start;
res[1] = end;
return res;
}
二分法训练:LeetCode 69 x的平方根
这里需要注意的是:强转应该是(long)int*int
public int mySqrt(int x) {
int left =0 ;
int right = x;
int ans=-1;
while(left<=right){
int mid = left+(right-left)/2;
if((long)mid*mid<=x){
ans = mid;
left = mid+1;
}else{
right =mid-1;
}
}
return ans;
}
双指针训练: LeetCode 26 删除重复元素
public int removeDuplicates(int[] nums) {
int n = nums.length;
int slow=0;
for(int i =1 ;i<n;i++){
if(nums[i]!=nums[slow]){
nums[slow+1] = nums[i];
slow++;
}
}
return slow+1;
}
双指针训练: LeetCode 283 移动0
public void moveZeroes(int[] nums) {
int n = nums.length;
int slow =0;
for(int i=0;i<n;i++){
if(nums[i]!=0){
nums[slow] = nums[i];
slow++;
}
}
for(int i=slow;i<n;i++){
nums[i]=0;
}
}
滑动窗口训练:LeetCode 904:水果成篮
public int totalFruit(int[] fruits) {
int max =0 ;
int n = fruits.length;
int left = 0;
Map<Integer,Integer> cnt = new HashMap<Integer,Integer>();
for(int i=0;i<n;i++){
cnt.put(fruits[i],cnt.getOrDefault(fruits[i],0)+1);
while(cnt.size()>2){
cnt.put(fruits[left],cnt.get(fruits[left])-1);
if(cnt.get(fruits[left])==0){
cnt.remove(fruits[left]);
}
left++;
}
max = Math.max(i-left+1,max);
}
return max;
}
这题因为有两种不同的果数,为了方便记录每种果数的数量,我们需要通过使用HashMap来储存种类和数量。(看了题解之后才会做)
总结:
双指针和二分法基本掌握,但是滑动窗口还需要再多加练习。
任务:在明天多加1-2题滑动窗口的练习