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 c878114 commit 8129effCopy full SHA for 8129eff
0540-single-element-in-a-sorted-array/0540-single-element-in-a-sorted-array.java
@@ -0,0 +1,26 @@
1
+class Solution {
2
+ public int singleNonDuplicate(int[] nums) {
3
+ int lo = 0;
4
+ int hi = nums.length - 1;
5
+ while (lo < hi) {
6
+ int mid = lo + (hi - lo) / 2;
7
+ boolean halvesAreEven = (hi - mid) % 2 == 0;
8
+ if (nums[mid + 1] == nums[mid]) {
9
+ if (halvesAreEven) {
10
+ lo = mid + 2;
11
+ } else {
12
+ hi = mid - 1;
13
+ }
14
+ } else if (nums[mid - 1] == nums[mid]) {
15
16
+ hi = mid - 2;
17
18
+ lo = mid + 1;
19
20
21
+ return nums[mid];
22
23
24
+ return nums[lo];
25
26
+}
0 commit comments