leetcode35~Search Insert Position

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;    }}