Skip to content

Instantly share code, notes, and snippets.

@laim2003
Created October 29, 2018 18:57
Show Gist options
  • Save laim2003/d263ab72b09299cbdef68f72dc074bb4 to your computer and use it in GitHub Desktop.
Save laim2003/d263ab72b09299cbdef68f72dc074bb4 to your computer and use it in GitHub Desktop.
import java.util.*;
public class Main {
public static void main(String[] args) {
int[] nums = {1,2,4,5,6};
int target;
target = 5;
// target = 0;
// target = 7;
System.out.print(searchInsert(nums, target));
}
public static int searchInsert(int[] nums1, int target) {
if (nums1 == null || nums1.length == 0) {
return 0;
}
int start = 0;
int end = nums1.length - 1;
int mid = start + (end - start)/2;
while (start + 1 < end) {
mid = start + (end - start)/2;
if (nums1[mid] == target) {
return mid;
} else if (nums1[mid] > target) {
end = mid;
} else {
start = mid;
}
}
if (nums1[start] >= target) {
return start;
} else if (nums1[start] < target && target <= nums1[end]) {
return end;
} else {
return end + 1;
}
}
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment