摘要：
！！！题目链接！！！ Solution： class Solution { public: int searchInsert(vector<int>& nums, int target) { int max = nums.size() -1 ; int min = 0; int mid = 0; i 阅读全文
posted @ 2022-01-05 10:35
ReaIms
阅读(48)
评论(0)
推荐(0)
摘要：
！！！题目链接！！！ // The API isBadVersion is defined for you. // bool isBadVersion(int version); class Solution { public: int firstBadVersion(int n) { long r 阅读全文
posted @ 2022-01-05 09:59
ReaIms
阅读(40)
评论(0)
推荐(0)
摘要：
！！！题目链接！！！ solution: class Solution { public: int search(vector<int>& nums, int target) { int min = 0; int mid = nums.size()/2; int max = nums.size(); 阅读全文
posted @ 2022-01-05 06:43
ReaIms
阅读(38)
评论(0)
推荐(0)
浙公网安备 33010602011771号