class Solution {
public int missingNumber(int[] nums) {
Arrays.sort(nums);
int n = nums.length;
for (int i = 0; i < n; i++) {
if (nums[i] != i) {
return i;
}
}
return n;
}
}
leetcode 268丢失的数字
最新推荐文章于 2024-07-24 11:56:55 发布