35. Search Insert Position
2017-05-02 17:34
204 查看
采用暴力查找的方式,虽然tag上有人说是二分查找
if(nums.length==0){
return 0;
}else {
for(int i = 0 ; i<nums.length ; i++){
if(target>nums[i]){
continue;
}else if(target<=nums[i]){
return i;
}
}
}
return nums.length;
运行时间是6ms
if(nums.length==0){
return 0;
}else {
for(int i = 0 ; i<nums.length ; i++){
if(target>nums[i]){
continue;
}else if(target<=nums[i]){
return i;
}
}
}
return nums.length;
运行时间是6ms
相关文章推荐
- leetcode[35]:Search Insert Position
- LeetCode-35-Search Insert Position 裸lower_bound
- 35. Search Insert Position
- leetcode - 35.Search Insert Position
- Leetcode35.Search Insert Position
- 35. Search Insert Position
- 35. Search Insert Position
- The Solution to Leetcode 35 Search Insert Position
- [LeetCode] 35.Search Insert Position
- LeetCode----- 35.Search Insert Position
- 35. Search Insert Position
- 35. Search Insert Position
- LeetCode | 35. Search Insert Position
- LeetCode@Array_35_Search_Insert_Position
- LeetCode-35-Search Insert Position(二分法)-Medium
- 2018.04.02 leeycode 打卡 #35 . Search Insert Position
- 35. Search Insert Position
- 35. Search Insert Position
- Leetcode(35) Search Insert Position
- 35. Search Insert Position #Medium