Arrays - Find missing numbers in a Sequence
If you know that the numbers are sorted and increasing:
for(var i = 1; i < numArray.length; i++) { if(numArray[i] - numArray[i-1] != 1) { //Not consecutive sequence, here you can break or do whatever you want }}
ES6-Style
var arr = [0189459, 0189460, 0189461, 0189463, 0189465]; var [min,max] = [Math.min(...arr), Math.max(...arr)];var out = Array.from(Array(max-min),(v,i)=>i+min).filter(i=>!arr.includes(i));Result: [189462, 189464]
Watch your leading zeroes, they will be dropped when the array is interpreted-
var A= [0189459, 0189460, 0189461, 0189463, 0189465]
(A returns [189459,189460,189461,189463,189465])
function absent(arr){ var mia= [], min= Math.min.apply('',arr), max= Math.max.apply('',arr); while(min<max){ if(arr.indexOf(++min)== -1) mia.push(min); } return mia;}var A= [0189459, 0189460, 0189461, 0189463, 0189465];alert(absent(A))
/* returned value: (Array)189462,189464*/