class Solution {
public int searchInsert(int[] nums, int target) {
int recordStatus = -1;
boolean flag = true;
for (int i = 0; i < nums.length; i++) {
if (target == nums[i])
return i;
else if (nums[i] > target && flag) {
recordStatus = i;
flag = false;
} else if (nums[i] < target && i == nums.length - 1)
return nums.length;
}
return recordStatus;
}
}
leetcode 35. 搜索插入位置
最新推荐文章于 2024-08-02 00:25:43 发布