尋找陣列中缺少的數字

function findLost(aryNum) {
aryNum.sort(function(a, b) {
return a > b;
});
if (aryNum.length > 1) {
var intAryIndex = 0,
intNumIndex = 0,
aryAns = [];
while (intNumIndex < aryNum[aryNum.length - 1]) {
if (aryNum[intAryIndex] !== intNumIndex) {
aryAns.push(intNumIndex);
} else {
intAryIndex++;
}
intNumIndex++;
}
return aryAns;
}
}
function findLostV2(aryNum) {
var aryAns = [];
for (var i = 0; i < aryNum[aryNum.length - 1]; i++) {
if (aryNum.indexOf(i) === -1) {
aryAns.push(i);
}
}
return aryAns;
}
console.log(findLost([2, 4, 6, 8, 10]));
console.log(findLostV2([1, 3, 5, 7, 9]));
view raw ans.js hosted with ❤ by GitHub
[問題] 尋找陣列中缺少的數字 給P幣5000 - 看板 Ajax - 批踢踢實業坊

document.evaluate

var links, thisLink;
links = document.evaluate("//a[@href]",
document,
null,
XPathResult.UNORDERED_NODE_SNAPSHOT_TYPE,
null);
for (var i = 0; i < links.snapshotLength; i++) {
var thisLink = links.snapshotItem(i);
console.log(thisLink.href);
}