题目链接:https://leetcode-cn.com/problems/search-insert-position/
题目如下:
class Solution {
public int searchInsert(int[] nums, int target) {
int i;
if(target<nums[0]) return 0;
else if(target>nums[nums.length-1]) return nums.length;
for(i=nums.length-1;i>=0;i--)
if(target==nums[i]) return i;
else if(target>nums[i]) return i+1;
return -1;
}
}