Leetcode Missing Number 268

来源：互联网发布：网络安全技术知识编辑：程序博客网时间：2024/05/19 12:11

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.

考虑线性时间同时空间尽可能小

遍历一遍求和

public class Solution { 
    public int missingNumber(int[] nums) { 
        int len = nums.length; 
        int sum = 0; 
        for(int i = 0;i < len; i++){ 
            sum += nums[i]; 
        } 
        int ans = (len + 1) * len / 2 - sum; 
        return ans; 
    } 
}

考虑数组很大的时候

0 0

【LeetCode】268 Missing Number
LeetCode(268)Missing Number
[leetcode 268]Missing Number
leetcode 268: Missing Number
Leetcode #268 Missing Number
[LeetCode 268] Missing Number
leetcode 268 Missing Number
[LeetCode]268 Missing Number
leetcode 268 : Missing Number
LeetCode 268 Missing Number
【LEETCODE】268-Missing Number
LeetCode 268: Missing Number
LeetCode 268 Missing Number
Leetcode Missing Number 268
LeetCode 268: Missing Number
LeetCode-268:Missing Number
LeetCode 268 Missing Number
LeetCode[268] Missing Number
学生排序
libLAS 读写点云数据（las2txt）
内核空间与用户空间打印调用栈
mysql5.7忘记root密码以及授权远程访问解决方案
linux学习笔记入门之目录结构和文件基本操作
Leetcode Missing Number 268
mysql数据库远程访问设置方法
HttpURLConnection POST 对象给 Servlet
socket04---流协议和粘包问题及解决
android build system
Node+Express+Jade
Linux虚拟机中安装JDK（以root用户身份安装）
JDOM解析XML
异或