704. 二分查找
题目链接:力扣
思路:定义左右指针,取平均
代码:
class Solution {
public int search(int[] nums, int target) {
int left = 0;
int right = nums.length;
int mid;
while(left<right){
mid = (right +left)/2;
if(target>nums[mid]){
left = mid+1;
}else if(target<nums[mid]){
right = mid;
}else{
return mid;
}
}
return -1;
}
}
收获:学习了二分查找的具体流程
27.移除元素
题目链接:
思路:数组移除元素,直接覆盖
class Solution {
public int removeElement(int[] nums, int val) {
int fast=0;
int slow=0;
for(int i=0;i<nums.length;i++){
if(nums[fast]!=val){
nums[slow++]=nums[fast];
}
fast++;
}
return slow;
}
}