算法训练营Day 1

1、二分查找

变量定义要遵循最小作用域原则。

第一种方法（左闭右闭），利用递归

#include <iostream>
#include <vector>

using namespace std;

int binarySearch(vector<int> &nums, int target, int left, int right){
    if(left > right)
        return -1;
    int mid = (left + right) / 2;
    if(nums[mid] == target)
        return mid;
    if(nums[mid] > target)
        return binarySearch(nums, target, left, mid - 1);
    else
        return binarySearch(nums, target, mid + 1, right); 
}

int search(vector<int> &nums, int target){
    int numsSize = nums.size();
    return binarySearch(nums, target, 0, numsSize - 1);
}

int main() {
    vector<int> nums = {1, 2, 3, 4, 5};
    cout << search(nums, 3) << endl;
}

第二种方法（左闭右闭），利用while循环

#include <iostream>
#include <vector>

using namespace std;

class Solution {
public:
    static int search(vector<int>& nums, int target) {
        int left = 0;
        int right = nums.size() - 1; // 定义target在左闭右闭的区间里，[left, right]
        while (left <= right) { // 当left==right，区间[left, right]依然有效，所以用 <=
            int middle = left + ((right - left) / 2);// 防止溢出 等同于(left + right)/2
            if (nums[middle] > target) {
                right = middle - 1; // target 在左区间，所以[left, middle - 1]
            } else if (nums[middle] < target) {
                left = middle + 1; // target 在右区间，所以[middle + 1, right]
            } else { // nums[middle] == target
                return middle; // 数组中找到目标值，直接返回下标
            }
        }
        return -1;
    }
};

int main() {
    vector<int> nums = {1, 2, 3, 4, 5};
    cout << Solution::search(nums, 3) << endl;
}

第三种方法（左闭右开），利用while循环

#include <iostream>
#include <vector>

using namespace std;

class Solution {
public:
    static int search(vector<int> &nums, int target) {
        int left = 0;
        int right = nums.size(); // 定义target在左闭右开的区间里，即：[left, right)
        while (left < right) { // 因为left == right的时候，在[left, right)是无效的空间，所以使用 <
            int middle = left + ((right - left) >> 1);
            if (nums[middle] > target) {
                right = middle; // target 在左区间，在[left, middle)中
            } else if (nums[middle] < target) {
                left = middle + 1; // target 在右区间，在[middle + 1, right)中
            } else { // nums[middle] == target
                return middle; // 数组中找到目标值，直接返回下标
            }
        }
        // 未找到目标值
        return -1;
    }
};

int main() {
    vector<int> nums = {1, 2, 3, 4, 5};
    cout << Solution::search(nums, 3) << endl;
}

2、移除元素

第一种方法，直接利用库函数

#include <iostream>
#include <vector>

using namespace std;

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

int main() {
    vector<int> nums = {1, 2, 3, 4, 5, 2};
    cout << Solution::removeElement(nums, 2) << endl;
}

第二种方法，暴力实现

#include <iostream>
#include <vector>

using namespace std;

class Solution {
public:
    static int removeElement(vector<int>& nums, int val) {
        int 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;
    }
};

int main() {
    vector<int> nums = {1, 2, 3, 4, 5, 2};
    cout << Solution::removeElement(nums, 2) << endl;
}

第三种方法，利用双指针

#include <iostream>
#include <vector>

using namespace std;

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

int main() {
    vector<int> nums = {1, 2, 3, 4, 5, 2};
    cout << Solution::removeElement(nums, 2) << endl;
}