LeetCode 刷题心得：从初学者到高手的成长之路（每日两题）

一、704题（二分查找）：

题目如下：

class Solution {
public:
    int search(vector<int>& nums, int target) {
        int  left = 0;
        int right = nums.size() - 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
            {   
                cout << middle << endl;
                return middle;
            }
        }
        
        return -1;
    }
};

二、27题(移除元素)

题目如下：

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