【Leetcode】【二分查找】
【704. 二分查找】https://leetcode-cn.com/problems/binary-search/
我的解决方案:
class Solution {
public:
int search(vector<int>& nums, int target) {
int start_idx = 0, end_idx = nums.size() - 1, mid_idx;
int start_num, end_num, mid_num;
原创
2022-02-21 09:25:50 ·
390 阅读 ·
0 评论