【二分法】LeetCode 35. Search Insert Position

LeetCode 35. Search Insert Position
Solution1：我的答案

class Solution {
public:int searchInsert(vector<int>& nums, int target) {if (!nums.size()) return 0;int left = 0, right = nums.size() - 1, mid = 0;while (left <= right) {int mid = (left + right)/2;if (nums[mid] < target)left = mid + 1;else if (nums[mid] > target)right = mid - 1;else return mid;}return left;//通过此题可以看出：普通的二分法结束时}               //left的值停在第一个>=target value的索引上
};

【二分法】LeetCode 35. Search Insert Position相关推荐

LeetCode - 35. Search Insert Position
35. Search Insert Position Problem's Link ---------------------------------------------------------- ...
leetcode 35 Search Insert Position(二分法)
Given a sorted array and a target value, return the index if the target is found. If not, return the ...
[LeetCode] 35. Search Insert Position
Given a sorted array and a target value, return the index if the target is found. If not, return the ...
LeetCode 35. Search Insert Position
题目: Given a sorted array and a target value, return the index if the target is found. If not, return ...
[LeetCode]--35. Search Insert Position
Given a sorted array and a target value, return the index if the target is found. If not, return the ...
[swift] LeetCode 35. Search Insert Position
Given a sorted array and a target value, return the index if the target is found. If not, return the ...
Leetcode#35. Search Insert Position
题目 Given a sorted array and a target value, return the index if the target is found. If not, return ...
leetcode python3 简单题35. Search Insert Position
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第三十五题 (1)题目英文: Given a sorted array and a ...
leetcode 【 Search Insert Position 】python 实现
题目: Given a sorted array and a target value, return the index if the target is found. If not, return ...

【二分法】LeetCode 35. Search Insert Position

【二分法】LeetCode 35. Search Insert Position相关推荐

最新文章

热门文章