本文共 569 字，大约阅读时间需要 1 分钟。

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?

Credits:

Special thanks to  for adding this problem and creating all test cases.

参考了别人的代码

code:

public class Solution268 {	 public int missingNumber(int[] nums) {	 		 int sum=0;		 for(int i=0; i<=nums.length; i++){			 sum+=i;		 }		 for(int i:nums)			 sum -=i;		 return sum;	 }}

转载地址：https://blog.csdn.net/zxdfc/article/details/48711667 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！