leetcode35~Search Insert Position

最新推荐文章于 2024-09-18 15:03:01 发布

淹不死的水

最新推荐文章于 2024-09-18 15:03:01 发布

阅读量215

点赞数

分类专栏： leetcode 文章标签： leetcode java

本文链接：https://blog.csdn.net/stone_yw/article/details/60963434

版权

leetcode 专栏收录该内容

106 篇文章 1 订阅

订阅专栏

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
You may assume no duplicates in the array.
Here are few examples.
[1,3,5,6], 5 → 2
[1,3,5,6], 2 → 1
[1,3,5,6], 7 → 4
[1,3,5,6], 0 → 0

两种方法，一个是从后向前遍历，一个是二分查找。按道理来说，二分查找应该更快一些，但是leetcode测试时，二分 7ms，从后向前遍历6ms.。。也是醉了

public class SearchInsertPosition {
    //从后向前遍历
    public int searchInsert2(int[] nums, int target) {
        for(int i=nums.length-1;i>=0;i--) {
            if(nums[i]>target) {
                continue;
            } else if(nums[i]<target) {
                return i+1;
            } else {
                return i;
            }
        }
        return 0;
    }
    //二分查找法
    public int searchInsert(int[] nums, int target) {
        int start=0;
        int end=nums.length-1;

        while(start<=end) {
            int mid=start+(end-start)/2;
            if(nums[mid]==target) {
                return mid;
            } else if(nums[mid]>target) {
                end = mid-1;
            } else {
                start=mid+1;
            }
        }
        return start;
    }
}