题目:
题解:
int singleNonDuplicate(int* nums, int numsSize) {int low = 0, high = numsSize - 1;while (low < high) {int mid = (high - low) / 2 + low;mid -= mid & 1;if (nums[mid] == nums[mid + 1]) {low = mid + 2;} else {high = mid;}}return nums[low];
}
题目:
题解:
int singleNonDuplicate(int* nums, int numsSize) {int low = 0, high = numsSize - 1;while (low < high) {int mid = (high - low) / 2 + low;mid -= mid & 1;if (nums[mid] == nums[mid + 1]) {low = mid + 2;} else {high = mid;}}return nums[low];
}
本文来自互联网用户投稿,该文观点仅代表作者本人,不代表本站立场。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如若转载,请注明出处:http://www.xdnf.cn/news/6489.html
如若内容造成侵权/违法违规/事实不符,请联系一条长河网进行投诉反馈,一经查实,立即删除!