简单~
27
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int k=0;
for(int i=0;i<nums.size();i++)
if(nums[i]!=val)
nums[k++]=nums[i];
return k;
}
};
704
class Solution {
public:
int search(vector<int>& nums, int target) {
int l=0;
int r=nums.size()-1;
while(l<=r){
int mid=l+r>>1;
if(nums[mid]==target) return mid;
else if(nums[mid]<target) l=mid+1;
else r=mid-1;
}
return -1;
}
};