https://leetcode.com/problems/single-element-in-a-sorted-array/description/
class Solution {
public:
int singleNonDuplicate(vector<int>& nums) {
int len = nums.size();
for(int i=0; i<len-2; i+=2){
if(nums[i] != nums[i+1]){
return nums[i];
}
}
return nums[len-1]; //循环没有返回,单一值一定是最后一个
}
};