二分查找类题目常规思路—Leetcode-thinking_record10

目录

 

插入位置（Easy）

总体思路

细节设计

代码实现

区间查找（Medium）

总体思路

区间左端点

区间右端点

细节设计

代码实现

旋转数组查找

总体思路

细节设计 

代码实现

---

插入位置（Easy）

LeetCode 35.Search Insert Position

给定一个排序数组nums（无重复元素）与目标值target,如果target在nums里出现，则返回target所在下标，如果target在nums里未出现，则返回target应该插入位置的数组下标，使得将target插入数组nums后，数组仍有序。

总体思路

细节设计

代码实现

#include <stdio.h>

#include <vector>

class Solution {
public:
    int searchInsert(std::vector<int>& nums, int target) {
        int index = -1;
		int begin = 0;
		int end = nums.size() - 1;
		while (index == -1){
			int mid = (begin + end) / 2;
			if (target == nums[mid]){
				index = mid;
			}
			else if (target < nums[mid]){
				if (mid == 0 || target > nums[mid - 1]){
					index = mid;
				}
				end = mid - 1;
			}
			else if (target > nums[mid]){
				if (mid == nums.size() - 1 || target < nums[mid + 1]){
					index = mid + 1;
				}
				begin = mid + 1;
			}
		}
		return index;
    }
};

int main(){
	int test[] = {1, 3, 5, 6};
	std::vector<int> nums;
	Solution solve;
	for (int i = 0; i < 4; i++){
		nums.push_back(test[i]);
	}
	for (int i = 0; i < 8; i++){
		printf("i = %d index = %d\n", i, solve.searchInsert(nums, i));
	}
	return 0;
}

区间查找（Medium）

LeetCode 34.Search for a Range

给定一个排序数组nums（nums中有重复元素）与目标值target，如果target在nums里出现，则返回target所在区间的左右端点下标，[左端点，右端点]，如果target在nums里未出现，则返回[-1,-1]。

总体思路

区间左端点

区间右端点

 

细节设计

分区间左右端点分别来设计定位算法。

代码实现

#include <stdio.h>

#include <vector>

int left_bound(std::vector<int>& nums, int target){
	int begin = 0;
	int end = nums.size() - 1;
	while(begin <= end){
		int mid = (begin + end) / 2;
		if (target == nums[mid]){
			if (mid == 0 || nums[mid -1] < target){
				return mid;
			}
			end = mid - 1;
		}
		else if (target < nums[mid]){
			end = mid - 1;
		}
		else if (target > nums[mid]){
			begin = mid + 1;
		}
	}
	return -1;
}

int right_bound(std::vector<int>& nums, int target){
	int begin = 0;
	int end = nums.size() - 1;
	while(begin <= end){
		int mid = (begin + end) / 2;
		if (target == nums[mid]){
			if (mid == nums.size() - 1 || nums[mid + 1] > target){
				return mid;
			}
			begin = mid + 1;
		}
		else if (target < nums[mid]){
			end = mid - 1;
		}
		else if (target > nums[mid]){
			begin = mid + 1;
		}
	}
	return -1;
}

class Solution {
public:
    std::vector<int> searchRange(std::vector<int>& nums, int target) {
        std::vector<int> result;
        result.push_back(left_bound(nums, target));
        result.push_back(right_bound(nums, target));
        return result;
    }
};

int main(){
	int test[] = {5, 7, 7, 8, 8, 8, 8, 10};
	std::vector<int> nums;
	Solution solve;
	for (int i = 0; i < 8; i++){
		nums.push_back(test[i]);
	}
	for (int i = 0; i < 12; i++){
		std::vector<int> result = solve.searchRange(nums, i);
		printf("%d : [%d, %d]\n",i , result[0], result[1]);
	}
	return 0;
}

旋转数组查找

LeetCode 33.Search in Rotated Sorted Array

给定一个排序数组nums(nums中有无重复元素)，且nums可能以某个未知下标旋转，给定目标值target，求target是否在nums中出现，若出现返回所在下标，未出现返回-1。

总体思路

细节设计 

 

代码实现

#include <stdio.h>

#include <vector>

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

int main(){
	int test[] = {9, 12, 15, 20, 1, 3, 6, 7};
	std::vector<int> nums;
	Solution solve;
	for (int i = 0; i < 8; i++){
		nums.push_back(test[i]);
	}
	for (int i = 0; i < 22; i++){
		printf("%d : %d\n", i, solve.search(nums, i));
	}
	return 0;
}