Given an array of integers, find the first missing positive integer in linear time and constant space. In other words, find the lowest positive integer that does not exist in the array. The array can contain duplicates and negative numbers as well. For e

Given an array of integers, find the first missing positive integer in linear time and constant space. In other words, find the lowest positive integer that does not exist in the array. The array can contain duplicates and negative numbers as well. For example, the input [3, 4, -1, 1] should give 2. The input [1, 2, 0] should give 3.

by Mukesh Yadav

JavaScript

var numbers = [3, 4, -1, 1];
//var numbers = [-1, 1, 3, 4];
//numbers = [1, 2, 0];

numbers.sort(function(a, b) {
  if (a > b) {
    return 1;
  }
  if (a < b) {
    return -1;
  }
  return 0;
});

console.log(numbers);

/*function missingNumber(numbers) {
  var nextNumber = numbers[0];
  for (var i = 0; i < numbers.length; i++) {
    if (nextNumber > 0 && numbers[i] !== nextNumber) {
      return nextNumber;
    }
    nextNumber++;
  }
}*/


function missingNumber(numbers) {
	var nextNumber = (numbers[0] + 1);
  for (var i = 1; i < numbers.length; i++) {
    if (nextNumber > 0 && numbers[i] !== nextNumber) {
      return nextNumber;
    }else if(nextNumber < 1){
    	i--;
    }
    nextNumber++;
  }
  return nextNumber;
}

console.log(missingNumber(numbers));