暑期算法打卡-Day2

最新推荐文章于 2024-04-28 15:02:01 发布

小灰QAQ

最新推荐文章于 2024-04-28 15:02:01 发布

阅读量209

点赞数

分类专栏：日常练习笔记 C++ 文章标签：大数据 c++ c语言算法动态规划

本文链接：https://blog.csdn.net/qq_62345394/article/details/125588932

版权

C++ 同时被 3 个专栏收录

43 篇文章 1 订阅

订阅专栏

日常练习

38 篇文章 1 订阅

订阅专栏

笔记

19 篇文章 0 订阅

订阅专栏

1.704. 二分查找

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

2.2089. 找出数组排序后的目标下标

class Solution {
public:
    vector<int> targetIndices(vector<int>& nums, int target) {
        int n = nums.size();
        sort(nums.begin(), nums.end());
        vector<int> res;
        for (int i = 0; i < n; ++i){
            if (nums[i] == target){
                res.push_back(i);
            }
        }
        return res;
    }
};

3. 287. 寻找重复数

class Solution {
public:
    int findDuplicate(vector<int>& nums) {
        int n = nums.size();
        int l = 1, r = n - 1, ans = -1;
        while (l <= r) {
            int mid = (l + r) >> 1;
            int cnt = 0;
            for (int i = 0; i < n; ++i) {
                cnt += nums[i] <= mid;
            }
            if (cnt <= mid) {
                l = mid + 1;
            } else {
                r = mid - 1;
                ans = mid;
            }
        }
        return ans;
    }
};