数组理论基础,704.二分查找,27.移除元素
原本计划用c++完成,但是还没学,先用c写然后看看别人用c++写完的代码吧。
704.二分查找:
在数组有序时查找效率比较高,查找过程中取中点(向下取整),定义low,high,mid当low = 0大于high = numslen-1时,查找结束。
int search(int* nums, int numsSize, int target) {
int low = 0;
int high = numsSize-1;
int mid = (low+high)/2;
while(low<=high){
mid = (low+high)/2;
if(nums[mid] > target)
high = mid-1;
else if(nums[mid] < target)
low = mid+1;
else return mid;
}
return -1;
}
下面先看看别人写的c++代码吧,写个注释:
class Solution {
public:
int search(vector<int>& nums, int target) {# 定义传入数组,target值
int i = 0, j = nums.size() - 1; # 定义low,high
while (i <= j) { # low小于等于high循环
int m = (i + j) / 2; # mid值等于mid+high / 2
if (nums[m] < target) i = m + 1; # 判断
else if (nums[m] > target) j = m - 1;
else return m;
}
return -1;
}
};
27.移除元素:
将不等于val值的数值存放在一个新的数组,新数组下标就是数组长度,在同一数组操作就是双指针了吧。
int removeElement(int* nums, int numsSize, int val) {
int left = 0;
for (int right = 0; right < numsSize; right++) {
if (nums[right] != val) {
nums[left] = nums[right];
left++;
}
}
return left;
}