leetcode:挿入位置の検索(java二分ソート)
744 ワード
100%打ち負かすよ
package LeetCode;
/*
, , 。 , 。
。
1:
: [1,3,5,6], 5
: 2
:
*/
public class SearchInsert {
public int searchInsert(int[] nums, int target) {
int left=0;
int right=nums.length-1;
int mid=0;
while (left<=right){
mid=(left+right)/2;
if (target>nums[mid]){
left=mid+1;
}else{
right=mid-1;
}
}
return left;
}
public static void main(String[] args) {
SearchInsert a=new SearchInsert();
int[] b={1,3,5,6};
System.out.println(a.searchInsert(b,5));
}
}