leetcode 35. Search Insert Position

java 实现

public class Solution {    public int searchInsert(int[] nums, int target) {        int len=nums.length;        int k=0;        if(len==0){            return 0;        }        for(int i=0;i<len;i++){            if(nums[i]>=target){                k=i;                break;            }else{                k=i+1;            }        }        return k;    }}