http://day1 704class Solution {
public int search(int[] nums, int target) {
int left=0;
int right=nums.length-1;
while(left<=right){
int middle=(right+left)/2; //为啥长度不能是减呢?
if(nums[middle]>target){
right=middle-1;
}else if(nums[middle]<target){
left=left+1;
}else{
return middle;//在这个循环的中必须到这一步
}
}
return -1;
}
}
class Solution {
public int removeElement(int[] nums, int val) {
int m=nums.length-1;
for(int i=0;i<m;i++){
if(nums[i]==val){
for(int j=i+1;j<m;j++){
nums[j-1]=nums[j];
}
i --;
m--;
}
}
return m;
}
}