【LeetCode】268. Missing Number 丢失的数字（Easy）（JAVA）

【LeetCode】268. Missing Number 丢失的数字（Easy）（JAVA）

题目地址: https://leetcode.com/problems/missing-number/

题目描述：

Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array.

Follow up: Could you implement a solution using only O(1) extra space complexity and O(n) runtime complexity?

Example 1:

Input: nums = [3,0,1]
Output: 2
Explanation: n = 3 since there are 3 numbers, so all numbers are in the range [0,3]. 2 is the missing number in the range since it does not appear in nums.

Example 2:

Input: nums = [0,1]
Output: 2
Explanation: n = 2 since there are 2 numbers, so all numbers are in the range [0,2]. 2 is the missing number in the range since it does not appear in nums.

Example 3:

Input: nums = [9,6,4,2,3,5,7,0,1]
Output: 8
Explanation: n = 9 since there are 9 numbers, so all numbers are in the range [0,9]. 8 is the missing number in the range since it does not appear in nums.

Example 4:

Input: nums = [0]
Output: 1
Explanation: n = 1 since there is 1 number, so all numbers are in the range [0,1]. 1 is the missing number in the range since it does not appear in nums.

Constraints:

• n == nums.length
• 1 <= n <= 10^4
• 0 <= nums[i] <= n
• All the numbers of nums are unique.

题目大意

给定一个包含 [0, n] 中 n 个数的数组 nums ，找出 [0, n] 这个范围内没有出现在数组中的那个数。

进阶：

• 你能否实现线性时间复杂度、仅使用额外常数空间的算法解决此问题?

解题方法

1. 题目要求空间复杂度 O(1)，时间复杂度是 O(n)，就不能用额外的数组（用额外的数组的话，直接创建一个 n 长度的数组，给出现过的位置置为 true，最后哪个位置为 false 就是丢失的数）
2. 从头往后遍历，如果 nums[i] = i 也就是相应的数字在对应的位置，那就继续
3. 如果不在对应位置， next = nums[i], 就把 nums[next] 填上 next 也就是对应的位置，然后再把 nums[next] 先前的数字放在对应位置，不断循环（如： [0,2,4,5,3], nums[2] = 2, nums[4] = 4, nums[3] = 3, 因为 5 超出范围了，所以停止了循环）

class Solution {
    public int missingNumber(int[] nums) {
        if (nums.length <= 0) return 0;
        for (int i = 0; i < nums.length; i++) {
            if (nums[i] == i) continue;
            int next = nums[i];
            while (next < nums.length && next != nums[next]) {
                int temp = nums[next];
                nums[next] = next;
                next = temp;
            }
        }
        for (int i = 0; i < nums.length; i++) {
            if (nums[i] != i) return i;
        }
        return nums.length;
    }
}

执行耗时:1 ms,击败了54.93% 的Java用户
内存消耗:39 MB,击败了65.17% 的Java用户

欢迎关注我的公众号，LeetCode 每日一题更新