LeetCode 35---Search Insert Position

public class Problem35 {
public static void main(String[] args) {
    // TODO Auto-generated method stub

}
public int searchInsert(int[] nums, int target) {
    for(int i=0;itarget) return i;
        if(i==nums.length-1) return nums.length;        
    }
    return nums.length;
}
}