We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 80d54ce commit 665141bCopy full SHA for 665141b
Easy/Search Insert Position.java
@@ -1,19 +1,17 @@
1
class Solution {
2
public int searchInsert(int[] nums, int target) {
3
- int low = 0;
4
- int high = nums.length - 1;
5
- while (low <= high) {
6
- int mid = (low + high) / 2;
+ int left = 0;
+ int right = nums.length - 1;
+ while (left <= right) {
+ int mid = (left + right) / 2;
7
if (nums[mid] == target) {
8
return mid;
9
- }
10
- else if (nums[mid] > target) {
11
- high = mid - 1;
12
13
- else {
14
- low = mid + 1;
+ } else if (nums[mid] > target) {
+ right = mid - 1;
+ } else {
+ left = mid + 1;
15
}
16
17
- return low;
+ return left;
18
19
0 commit comments