二分查找
class Solution {
public int search(int[] nums, int target) {
int left = 0, right = nums.length - 1;
int middle;
while(left<=right){
middle=(left+right)/2;
if(nums[middle]>target){
right=middle-1;
}
else if(nums[middle]<target){
left=middle+1;
}
else
return middle;
}
return -1;
}
}
删除数组指定元素
class Solution {
public int removeElement(int[] nums, int val) {
int fast;
int slow=0;
for(fast=0;fast<nums.length;fast++){
if(nums[fast]!=val){
nums[slow++]=nums[fast];
}
}
return slow;
}
}