leetcode 540. Single Element in a Sorted Array
2017-08-10 10:57
351 查看
原题
从有序数列中找出那个单身狗。
int singleNonDuplicate(int* nums, int numsSize) {
int result;
result=*nums;
for(int n=1;n<numsSize;n++)
{
result^=*(nums+n);
}
return result;
}
唉,单身狗怎么又讨人嫌。。。
从有序数列中找出那个单身狗。
int singleNonDuplicate(int* nums, int numsSize) {
int result;
result=*nums;
for(int n=1;n<numsSize;n++)
{
result^=*(nums+n);
}
return result;
}
唉,单身狗怎么又讨人嫌。。。
相关文章推荐
- leetcode 540. Single Element in a Sorted Array
- LeetCode 540. Single Element in a Sorted Array
- leetcode 540. Single Element in a Sorted Array
- [Leetcode] 540. Single Element in a Sorted Array 解题报告
- python--leetcode540. Single Element in a Sorted Array
- [LeetCode]540. Single Element in a Sorted Array
- 【LeetCode】540. Single Element in a Sorted Array 解题报告
- LeetCode 540. Single Element in a Sorted Array (Medium)
- (Java) LeetCode 540. Single Element in a Sorted Array —— 有序数组中的单一元素
- LeetCode - 540. Single Element in a Sorted Array
- LeetCode 540. Single Element in a Sorted Array
- {LeetCode} 540. Single Element in a Sorted Array
- 【LeetCode】540. Single Element in a Sorted Array
- [LeetCode]540. Single Element in a Sorted Array
- leetcode 540. Single Element in a Sorted Array 题解
- LeetCode | 540. Single Element in a Sorted Array
- LeetCode 540. Single Element in a Sorted Array
- [LeetCode] 540. Single Element in a Sorted Array
- 540. Single Element in a Sorted Array
- LeetCode-M-Single Element in a Sorted Array