09 2019 档案

旋转数组中的二分查找
摘要：class Solution { public: int search(vector<int>& nums, int target) { if(nums.size() == 0) return -1; int low = 0, high = nums.size()-1, mid; while(low+1 < high) { mid = (high - low)/2 + low; if(nums[m 阅读全文
posted @ 2019-09-04 21:32 unicoe 阅读(499) 评论(0) 推荐(0)