Leetcode daily question brushing record --540 A single element in an ordered array

leetcode Record of writing questions

540. A single element in an ordered array

Give you an ordered array of integers only , Each of these elements will appear twice , Only one number will appear once .

Please find and return the number that only appears once .

The solution you design must meet O(log n) Time complexity and O(1) Spatial complexity .

Example 1:

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

Example 2:

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

class Solution {
    
    public int singleNonDuplicate(int[] nums) {
    
        for(int i = 1;i < nums.length;i+=2){
    
            if(nums[i] != nums[i - 1]){
    
                return nums[i-1];
            }
        }
        return nums[nums.length - 1];
    }
}

tip： For the first time, the code idea is the same as that of sister Sanye , Very, very happy ~ Hey ！