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 e9e8abf commit 1934b8aCopy full SHA for 1934b8a
Modified Binary Search/540_Single_Element_in_a_Sorted_Array.java
@@ -1,21 +1,21 @@
1
class Solution {
2
public int singleNonDuplicate(int[] nums) {
3
- int low = 0, high = nums.length - 1;
+ int left = 0, right = nums.length - 1;
4
5
- while (low < high) {
6
- int mid = low + (high - low) / 2;
+ while (left < right) {
+ int mid = left + (right - left) / 2;
7
8
if (mid % 2 == 1) {
9
- mid--;
+ --mid;
10
}
11
12
- if (nums[mid] != nums[mid + 1]) {
13
- high = mid;
+ if (nums[mid] == nums[mid + 1]) {
+ left = mid + 2;
14
} else {
15
- low = mid + 2;
+ right = mid;
16
17
18
19
- return nums[low];
+ return nums[left];
20
21
0 commit comments