540_Single_Element_in_a_Sorted_Array(Binary Search)

CodingProgrammer · CodingProgrammer · commit ee80cf3417c8 · 2018-04-19T20:57:20.000+08:00
diff --git a/540_Single_Element_in_a_Sorted_Array(Binary Search).py b/540_Single_Element_in_a_Sorted_Array(Binary Search).py
@@ -0,0 +1,16 @@
+class Solution:
+    def singleNonDuplicate(self, nums):
+        """
+        :type nums: List[int]
+        :rtype: int
+        """
+        start, end = 0, len(nums) - 1
+        while (start < end):
+            mid = (start + end) // 2
+            if mid % 2 == 1 :
+                mid = mid - 1
+            if nums[mid] != nums[mid + 1]:
+                end = mid
+            else:
+                start = mid + 2
+        return nums[start]
