540. Single Element in a Sorted Array

Given a sorted array consisting of only integers where every element appears twice except for one element which appears once. Find this single element that appears only once. 

Example 1:

Input: [1,1,2,3,3,4,4,8,8]
Output: 2

Example 2:

Input: [3,3,7,7,10,11,11]
Output: 10

Note: Your solution should run in O(log n) time and O(1) space.

这里时间复杂度要求是O(log n)，所以要用二分查找。关键是找那个变换mid的规则。这里会发现每个ele出现两次，找那个只出现一次的。左边初始化-1，右边初始化n / 2。判断条件nums[mid * 2] != nums[mid * 2 + 1]。mid * 2肯定是偶数，也对应一个新出现的数。如果他跟后面的数相等，说明这不是我们要找的数，也说明左半部分肯定不会出现我们要找的数，left = mid。当nums[mid * 2]不等于nums[mid * 2 + 1]时，说明左边一定有一个单数，right = mid。代码如下：

public class Solution {
    public int singleNonDuplicate(int[] nums) {
        int n = nums.length, left = -1, right = n / 2;
        while (left + 1 < right) {
            int mid = left + (right - left) / 2;
            if (nums[mid * 2] != nums[mid * 2 + 1]) {
                right = mid;
            } else {
                left = mid;
            }
        }
        return nums[right * 2];
    }
}