目录
1.学习内容
(1)704二分查找
题目链接:https://leetcode.cn/problems/binary-search/
文章讲解:https://programmercarl.com/0704.%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE.html
视频讲解:https://www.bilibili.com/video/BV1fA4y1o715
(2)27移除元素
题目链接:https://leetcode.cn/problems/remove-element/、
文章讲解:https://programmercarl.com/0027.%E7%A7%BB%E9%99%A4%E5%85%83%E7%B4%A0.html
视频讲解:https://www.bilibili.com/video/BV12A4y1Z7LP
2.学习成果
704二分查找
class Solution {
public:
int search(vector<int>& nums, int target) {
int left=0;
int right = nums.size() - 1;
//int right=sizeof(nums)/sizeof(nums[0])-1;
while(left<=right)
{
int middle=left+((right-left)/2);
if(nums[middle]>target)
{
right=middle-1;
}
else if(nums[middle]<target)
{
left=middle+1;
}
else
{
return middle;
}
}
return -1;
}
};
27移除元素
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int fast;
int slow=0;
for(fast=0;fast<nums.size();fast++)
{
if(nums[fast]!=val)
{
nums[slow++]=nums[fast];
//slow ++;
}
}
return slow;
}
};