268. Missing Number

最新推荐文章于 2023-08-03 20:57:30 发布

沐婉清

最新推荐文章于 2023-08-03 20:57:30 发布

阅读量288

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/zhning12L/article/details/72854334

版权

leetcode 专栏收录该内容

11 篇文章 0 订阅

订阅专栏

题目

Given an array containing n distinct numbers taken from 0, 1, 2, …, n, find the one that is missing from the array.

For example,
Given nums = [0, 1, 3] return 2.

Note:
Your algorithm should run in linear runtime complexity. Could you implement it using only constant extra space complexity?

代码

import java.util.Arrays;
import java.util.MissingFormatArgumentException;

public class Solution {
    //一开始自己写的暴力拆解法 复杂度较高
    public static int missingNumber(int[] nums) {
        //数组为空时返回0
        if(nums==null)
            return 0;
        //对数组排序
        Arrays.sort(nums);
        //数组不为空时
        //遍历进行寻找
        for(int i=0;i<nums.length;i++){
            if(nums[i]!=i){
                return i;
            }
        }
        return nums.length;
        }

        //另一种方法，可能复杂度会稍微低点？但费空间一点
        if (nums.length<=0)
            return 0;
        int[] arr=new int[nums.length+1];
        for(int i=0;i<nums.length;i++){
            arr[nums[i]]=nums[i];
        }
        for(int i=0;i<=nums.length;i++){
            if(arr[i]==0)
                if(i!=0)
                    return i;
        }
        return nums.length;

    //看了别人写的...用了脑子的方法，复杂度大大降低了
    public class Solution {
    public int missingNumber(int[] nums) {
        int length = nums.length;
        int total = (length)*(length+1)/2;

        for(int i = 0; i < nums.length; i++){
            total-=nums[i];
        }

        return total;
    }
}