public class Solution {
/**
* @param nums: an array of integers
* @return: an integer
*/
public int findMissing(int[] nums) {
// write your code here
Arrays.sort(nums);
int N = nums.length;
int start = 0;
int end = N - 1;
while (start + 1 < end) {
int mid = start + (end - start) / 2;
if (nums[mid] > mid) end = mid;
else start = mid;
}
if (nums[start] != start) return start;
else if (nums[end] != end) return end;
else return end + 1;
}
}
public class Solution {
/**
* @param nums: an array of integers
* @return: an integer
*/
public int findMissing(int[] nums) {
// write your code here
int N = nums.length;
int sum = 0;
for (int i = 0; i < N; i++) {
sum += nums[i];
}
return N * (N + 1) /2 - sum;
}
}
public class Solution {
/**
* @param nums: an array of integers
* @return: an integer
*/
public int findMissing(int[] nums) {
// write your code here
Arrays.sort(nums);
int N = nums.length;
int start = 0;
int end = N - 1;
while (start + 1 < end) {
int mid = start + (end - start) / 2;
if (nums[mid] > mid) end = mid;
else start = mid;
}
if (nums[start] != start) return start;
else if (nums[end] != end) return end;
else return end + 1;
}
}
196.Find the Missing Number
最后编辑于 :
©著作权归作者所有,转载或内容合作请联系作者
- 文/潘晓璐 我一进店门,熙熙楼的掌柜王于贵愁眉苦脸地迎上来,“玉大人,你说我怎么就摊上这事。” “怎么了?”我有些...
- 文/花漫 我一把揭开白布。 她就那样静静地躺着,像睡着了一般。 火红的嫁衣衬着肌肤如雪。 梳的纹丝不乱的头发上,一...
- 文/苍兰香墨 我猛地睁开眼,长吁一口气:“原来是场噩梦啊……” “哼!你这毒妇竟也来了?” 一声冷哼从身侧响起,我...
推荐阅读更多精彩内容
- 【题目描述】 Given an array containsNnumbers of 0 ..N, find whi...