[自我记录]随想录刷题第一天 | 704.二分查找, 27.移除元素

代码随想录打卡第一天, 新手自我记录一下刷题历程.

704. 二分查找

经典简单题, 寻找target下标位置,没有返回-1.

有序数组提示可以使用二分法, 根据target和中间值的比较移动左或右区间界限, 个人比较习惯左闭右闭的区间写法

class Solution {
public:
    int search(vector<int>& nums, int target) {

        int right = nums.size()-1;
        int left = 0;
        int middle = left + (right - left) / 2;
        while (left <= right){
            if (nums[middle] < target){
                left = middle + 1;
                middle = left + (right - left) / 2;
            }
            else if (nums[middle] > target){
                right = middle - 1;
                middle = left + (right - left) / 2;
            }
            else{
                return middle;
            }
        }
        return -1;
    }
};

Tips: 为了避免left+right太大数值溢出, 可以写成middle = left + (right - left) / 2, 我自己老是忘记...

看了标准答案后发现也可以写成位运算的形式:

middle = left + ((right - left) >> 1)

---

27. 移除元素

数组不能直接删除只能覆盖!

O(1)空间原地修改输入数组 --> 双指针的思路

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

但是看到有提示说也可以暴力解法写一下试试, 于是又写了下暴力解法, 结果我还写错了...

没注意到第二层for循环将后半段数组整体前移一位以后, 当前指针所指元素也变化了

暴力解法:

class Solution {
public:
    int removeElement(vector<int>& nums, int val){
        int count = 0;
        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--;
            }
        }
        return nums.size() - count;
    }
};