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 index where it would be if it were inserted in order.

You may assume no duplicates in the array.

Example 1:

Input: [1,3,5,6], 5
Output: 2

Example 2:

Input: [1,3,5,6], 2
Output: 1

Example 3:

Input: [1,3,5,6], 7
Output: 4

Example 1:

Input: [1,3,5,6], 0
Output: 0

给定一个有序数组和目标值，如果找到目标，则返回索引。 如果没有按顺序插入,则返回插入后的索引。你可能会认为没有重复的数组。

代码如下:

public class SearchInsertPosition {

	public static void main(String[] args) {
		int[] nums = new int[]{1,3,5,6};
		System.out.println(searchInsert(nums,7));
	}
	
    public static int searchInsert(int[] nums, int target) {
        int index = -1;
        if(nums.length < 0) {
        	return index;
        }
        for (int i = 0; i < nums.length; i++) {
			if(nums[i]== target) {
				index = i;
				break;
			}else if(target < nums[i]) {
				index = i;
				break;
			}else {
				index = i+1;
			}
		}
        return index;
    }

}