class Solution {
public int searchInsert(int[] nums, int target) {
int len = nums.length;
for (int i = 0; i < len; i++) {
if (nums[i] < target ){
continue;
}else if (nums[i] == target){
return i;
}else {
// System.out.println(i);
return i;
}
}
return len;
}
}
没啥说的。。