package LeetCode.contact;
class Solution_35 {
public int searchInsert(int[] nums, int target) {
int index = 0;
while(target <= nums[0]){index = 0;break;}
while(target == nums[nums.length-1]){index = nums.length-1;break;}
while(target > nums[nums.length-1]){index = nums.length;break;}
for(int i = 0;i<nums.length-1;i++){
if(target == nums[i]){
index = i;
break;}
else if(target > nums[i] && target<nums[i+1] ){
index = i+1;
break;
}
}
return index;
}
}
public class leetcode_35 {
public static void main(String[] args){
int target = 7;
int[] arr = new int[]{1,3,5,6};
Solution_35 so = new Solution_35();
int index = so.searchInsert(arr, target);
System.out.println(index);
}
}
LeetCode_35:搜索插入位置:Java
最新推荐文章于 2024-08-04 16:45:57 发布