05. 剑指offer刷题-搜索算法

学得尽兴

已于 2024-08-17 20:19:56 修改

阅读量67

点赞数 2

分类专栏：剑指offer刷题文章标签：算法 leetcode 数据结构 c++

于 2024-08-14 15:36:41 首次发布

本文链接：https://blog.csdn.net/weixin_51952055/article/details/141192255

版权

剑指offer刷题专栏收录该内容

6 篇文章 0 订阅

订阅专栏

class Solution {
public:

    int GetNumberOfK(vector<int>& nums, int k) {
        if(nums.size() < 1) return 0;

        int left = left_bound(nums, k);
        int right = right_bound(nums, k);

        return left == -1 ? 0 : right - left + 1;
    }


    int left_bound(vector<int>& nums, int k){
        int left = 0, right = nums.size() - 1;
        while(left <= right){
            int mid = left + (right - left)/2;
            if(nums[mid] >= k) right = mid - 1;
            else left = mid + 1;
        }
        if(left >= nums.size()|| nums[left] != k) return -1;
        return left;
    }

    int right_bound(vector<int>& nums, int k){
        int left = 0, right = nums.size() - 1;
        while(left <= right){
            int mid = left + (right - left)/2;
            if(nums[mid] <= k) left = mid + 1;
            else right = mid - 1;
        }
        if(right < 0 || nums[right] != k) return -1;
        return right;
    }
};

class Solution {
public:
    int minNumberInRotateArray(vector<int>& nums) {
        
        int left = 0, right = nums.size() - 1;

        while(left < right){
            int mid = left + (right - left)/2;
            if(nums[mid] < nums[right]) right = mid;
            else if(nums[mid] == nums[right]) right--; // 缩小范围继续判断
            else left = mid + 1;
        }
        
        return nums[right];
    }
};

#include <string>
class Solution {
public:
    vector<string> res;
    string path;
    vector<string> Permutation(string str) {
        if(str.empty()) return res;

        vector<bool> used(str.size(), false);
        backtracking(str, used);
        return res;
    }

    void backtracking(string& str, vector<bool>& used){

        if(path.size() == str.size()){
            res.push_back(path);
            return;
        }
        unordered_set<char> uset;
        for(int i = 0; i < str.size(); i++){
            if(used[i] == true || uset.find(str[i]) != uset.end()) continue;
            path.push_back(str[i]); used[i] = true;
            uset.insert(str[i]);
            backtracking(str, used);
            path.pop_back(); used[i] = false;
        }
    }
};

class Solution {
public:
    int minNumberInRotateArray(vector<int>& nums) {
        
        int left = 0, right = nums.size() - 1;

        while(left < right){
            int mid = left + (right - left)/2;
            if(nums[mid] < nums[right]) right = mid;
            else if(nums[mid] == nums[right]) right--;
            else left = mid + 1;
        }
        
        return nums[right];
    }
};