var findDisappearedNumbers = function(nums) {
var res = [];
for(var i=1;i<nums.length+1;i++){
if(nums.indexOf(i)===1)res.push(i)
}
return res
};
My JS solution! 92ms




@1425831934 hey, use 'indexOf' once already spends O(n) time, so it seems the time complexity of this method is O( n power 2 ). Then TLE problem occurs.