题目:LeetCode 704
class Solution {
public:
int search(vector& nums, int target) {
int left=0,right=nums.size()-1;
while(left<=right){
int mid=(right+left)/2;
int num=nums[mid];
if(num==target){
return mid;
}else if(num>target){
right=mid-1;
}else{
left=mid+1;
}
}
return -1;
}
};
题目:LeetCode 27
int removeElement(int* nums, int numsSize, int val) {
int j = 0;
for (int i = 0; i < numsSize; i++) {
if (nums[i] != val) {
nums[j] = nums[i];
j++;
}
}
return j;
}