搜索插入位置
-
题目描述:
-
方法:
package SearchInsertionLocation; public class SearchInsertionLocation01 { public static void main(String[] args) { System.out.println(searchInsert(new int[]{1,3,5,6},5)); System.out.println(searchInsert(new int[]{1,3,5,6},2)); System.out.println(searchInsert(new int[]{1,3,5,6},7)); System.out.println(searchInsert(new int[]{1,3,5,6},0)); } public static int searchInsert(int[] nums, int target) { int i = 0; for (;i < nums.length;i++){ if (target == nums[i]) return i; if (target < nums[i]) break; } return i; } }