解法1:
class Solution {
public int searchInsert(int[] nums, int target) {
for (int i = 0; i < nums.length; i++) {
if (target == nums[i]){
return i;
}
if (target < nums[i]){
return i;
}
if (target > nums[i]) {
try {
if (target < nums[i+1]){ //从中间插入
return i+1;
}
}catch(Exception e) { //已经遍历全部,从最后插入
return i+1;
}
}
}
return 100;
}
}
解法2:
class Solution {
public int searchInsert(int[] nums, int target) {
for (int i = 0; i < nums.length; i++) {
if (nums[i] >= target) {
return i;
}
}
return nums.length;
}
}
note:
1.解法一是我自己写的,解法二是讨论区里看到的,确实比我简洁多了,暂时没发现什么Bug