540. Single Element in a Sorted Array

540. Single Element in a Sorted Array

Given a sortedarray consisting of only integers where every element appears twice except forone element which appears once. Find this single element that appears onlyonce.

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

這個問題就是設置一個循環參數i，i的初始值爲0，然後對比數組中的nums[i]和nums[i+1]是否一樣，如果不一樣，那麼跳出for循環，返回nums[i]的值，如果一樣，那麼i=i+2，進一步驗證nums[i+2]和nums[i+3]是否一樣。

int singleNonDuplicate(int* nums, int numsSize) {
    int p=0;
    for(int i=0;i<numsSize;i=i+2){
        if(nums[i]!=nums[i+1]) {
            p=nums[i];
            break;
    }
    }
    return p;
}