LeetCode 35 Search Insert Position（查找插入位置）

package leetcode_50;

import java.util.Arrays;

/***
 * 
 * @author pengfei_zheng
 * 找出插入元素应当插入的下标
 */
public class Solution35 {
    public static int searchInsert(int[] nums, int target) {
        int ans = Arrays.binarySearch(nums, target);
        if(ans>=0)
            return ans;
        else 
            return -ans-1;
    }
    public static void main(String[]args){
        int []nums={1,3,5,6};
        System.out.println(searchInsert(nums,0));
    }
    
}