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 24f3e27 commit e6c61cfCopy full SHA for e6c61cf
java/0540-single-element-in-a-sorted-array.java
@@ -0,0 +1,26 @@
1
+/*
2
+----------------------------------
3
+ Time Complexity: O(log(n))
4
+ Space Complexity: O(1)
5
+---------------------------------*/
6
+
7
+class Solution {
8
+ public int singleNonDuplicate(int[] nums) {
9
+ int l = 0;
10
+ int r = nums.length-1;
11
12
+ while(l <= r){
13
+ int m = l + (r-l)/2 ;
14
+ if((m - 1 < 0 || nums[m-1] != nums[m]) && (m + 1 == nums.length || nums[m] != nums[m+1]))
15
+ return nums[m];
16
17
+ int leftSize = 0;
18
+ leftSize = (nums[m-1] == nums[m])? m-1 : m;
19
+ if(leftSize % 2 == 1)
20
+ r = m - 1;
21
+ else
22
+ l = m + 1;
23
+ }
24
+ return -1;
25
26
+}
0 commit comments