代码随想录第一天打卡
704二分查找
在这里插入代码片
class Solution {
public:
int search(vector<int>& nums, int target) {
int left,right,mid;
left = 0;
right = nums.size() - 1;
while(left <= right){
mid = left + (right - left) / 2;
if(nums[mid] > target){
right = mid -1;
}
else if(nums[mid] == target){
return mid;
}
else
{
left = mid + 1;
}
}
return -1;
};
};
35 搜索插入位置
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int left,right,mid;
left = 0;
right = nums.size() - 1;
while(left <= right){
mid = left + (right - left) / 2;
if(nums[mid] > target){
right = mid -1;
}
else if(nums[mid] == target){
return mid;
}
else
{
left = mid + 1;
}
}
return left;
};
};
27
1 暴力查找,再找出来后更新数组
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
auto size = nums.size();
for(int i = 0 ; i < size ;i++){
if(nums[i] == val){
for(int j = i + 1 ; j < size; j++){
nums[j - 1] = nums[j];
}
i--;
size--;
}
}
return size;
}
};
2 双指针法学习
通过快慢指针,慢指针只在快指针位置的值不等于要找的值时向前移动,如果相等就不移动,这样就实现了长度的计数,而通过移动时的将快指针赋值给慢指针操作又实现了后边的不应被删除的值向前移动的效果。
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int slow = 0;
for (int fast = 0; fast < nums.size(); fast++) {
if (val != nums[fast]) {
nums[slow++] = nums[fast];
}
}
return slow;
}
};