09 2022 档案

二分模板
摘要：int search(vector<int>& nums, int target) { int left = 0, right = nums.size(); int mid; while(left < right) { mid = (left + right) >> 1; if(nums[mid] 阅读全文
posted @ 2022-09-23 15:01 Zforw 阅读(21) 评论(0) 推荐(0)