代码随想录算法训练营Day01|704.二分查找、27.移除元素

题目链接 ：

704. 二分查找 - 力扣（LeetCode）

class Solution
 {
public:
    int search(vector<int>& nums, int target) 
    {
       int left = 0; //左边界
       int right = nums.size()-1; //右边界
       while(right >= left)
       {
        int middle = left + ((right-left)/2);
        if (nums[middle] > target){
           right = middle-1;
         }
         if (nums[middle] < target){
           left = middle+1;
        }
        if (nums[middle] == target){
           return middle;
        }
       }
        return -1;
    }
};

27. 移除元素 - 力扣（LeetCode）

class Solution 
{
public:
    int removeElement(vector<int>& nums, int val) 
    
    {
      int fast = 0;
      int slow = 0;
      int len = nums.size();
      for (fast = 0; fast < len; fast++){
        if (nums[fast] != val){
          nums[slow] = nums[fast];
          slow++;
        }
      }
      return slow;

    }
};