题目链接:704:二分查找
class Solution {
public:
int search(vector<int>& nums, int target) {
int left = 0, right = nums.size() - 1;
while(left <= right) {
int middle = left + (right - left) / 2;//防止溢出
if (nums[middle] < target) {
left = middle + 1;
}
else if (nums[middle] > target) {
right = middle - 1;
}
else {
return middle;
}
//cout << middle << endl;
}
return -1;
}
};
这是一道很正常的二分查找,可以直接写出来.
相关题目:27:移除元素
看到这道题,我的第一反应是双指针,但我当时想的是两个指针一前一后同时遍历,但是当时写的很乱,最后没有做出来,然后就开始了暴力解法:
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int count = 0;
if(nums.size() == 0)
return 0;
if (nums[0] == val && nums.size() == 1)
return 0;
if (nums[0] != val && nums.size() == 1)
return 1;
for (int i = 0; i < nums.size() - count; i++) {
if (nums[i] == val) {
for( int j = i; j < nums.size() - 1; j++) {
nums[j] = nums[j + 1];
}
count ++;
i = i - 1;
}
}
return nums.size() - count;
}
};
这个代码我写了一个count,因为每次移除元素时,会使数组长度整体减一.
然后看了卡哥的,把双指针的写了出来
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int slow = 0, fast = 0;
for (;fast < nums.size(); fast ++) {
if (nums[fast] != val) {
nums[slow] = nums[fast];
slow ++;
}
}
return slow;
}
};