题目链接
题目描述
解题思路
方法一:直接遍历
class Solution {public int missingNumber(int[] nums) {int len = nums.length;for(int i=0; i<len; i++) {if(nums[i] != i) {return i;}}return len;}}
方法二:二分法
class Solution {public int missingNumber(int[] nums) {int i = 0, j = nums.length - 1;while(i < j) {int m = (i + j) / 2;if(nums[m] == m) i = m + 1;else j = m - 1;}return i;}}
