(Algorithms in Javascript) Leetcode 268. Missing Number - Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.

leetcode-268-missing-number.js

const missingNumber = (nums) => {
	let len = nums.length;
	if(len===0) return 0;
	
	result = 0;
	for (let i=0; i<len; i++) {
		result += nums[i] - i;
	}
	return len - result;
};

console.log(missingNumber([3,0,1]));
console.log(missingNumber([9,6,4,2,3,5,7,0,1]));