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

思路：这个算法问题应该是比较简单的，利用for循环便可以解决。

注意：利用break跳出循环

public class Solution 
{
    int flag;
    public int searchInsert(int[] nums, int target)
    {
        //先处理能够在数组中找到的值
        for(int i=0;i<nums.length;i++)      
        {
            
            if(nums[i]>=target)
            {
                flag=i;
                break;
            }
            else
            {
                target=target;
                if(i==nums.length-1)
                {
                    flag=nums.length;
                    break;
                }
            }
        }
                return flag;
    }
}

利用二分法解决：

public class Solution {
    public int searchInsert(int[] nums, int target) {
        if (nums == null || nums.length == 0) {
            return -1;
        }
        int left = 0;
        int right = nums.length - 1;
        while (left + 1 < right) {
            int mid = (left - right) / 2 + right;
            if (nums[mid] == target) {
                return mid;
            }
            if (nums[mid] < target) {
                left = mid;
            } else {
                right = mid;
            }
        }
        if (nums[left] >= target) {
            return left;
        } else if (nums[right] >= target) {
            return right;
        } else {
            return nums.length;
        }
    }
}

第二种方法的运行更快。