LeetCode
天蝎座的程序员
这个作者很懒,什么都没留下…
展开
-
LeetCode367. 有效的完全平方数
题目传送门:367题二分:class Solution {public: bool isPerfectSquare(int num) { int l=1,r=num; while(l<r) { int mid=(l+1ll+r)>>1; if(mid<=num/mid) l=mid; else r=mid-1; } re原创 2022-04-19 20:57:27 · 110 阅读 · 0 评论 -
LeetCode852. 山脉数组的峰顶索引
题目传送门:852题class Solution {public: int peakIndexInMountainArray(vector<int>& arr) { int l = 0, r = arr.size() - 1; while (l < r) { int mid = l + r + 1 >> 1; if (arr[mid] > arr[mid - 1]) l =原创 2022-04-18 10:40:29 · 1052 阅读 · 0 评论 -
LeetCode35. 搜索插入位置
题目传送门:35题class Solution {public: int searchInsert(vector<int>& nums, int target) { int l=0,r=nums.size(); //插入位置可能是nums.size()不用减1 while(l<r) { int mid=l+r>>1; if(nums[mid]>=target原创 2022-04-18 10:25:53 · 525 阅读 · 0 评论 -
LeetCode374. 猜数字大小
题目传送门:374题class Solution {public: int guessNumber(int n) { int l = 1, r = n; while (l < r) { int mid = (long long)l + r >> 1; if (!guess(mid)) return mid; else if(guess(mid)<0) r=mid-1;原创 2022-04-17 21:39:07 · 567 阅读 · 0 评论 -
LeetCode704. 二分查找
题目传送门:704题class Solution {public: int search(vector<int>& nums, int target) { int l=0,r=nums.size()-1; while(l<=r){ int mid=(r+l)>>1; if(nums[mid]==target) return mid; else if(num原创 2022-04-17 21:29:34 · 259 阅读 · 0 评论