CNRS Research Engineer at LIRMM, Montpellier, France.
count0 = {
let counts = []
for (let i = 0; i < entryLength; i++)
counts.push(countAtPos(textInput, "0", i))
return counts
}
countAtPos = ( list, value, pos ) => {
return list.filter( val => val[pos] === value).length
}
gamma = {
let res = ""
for (let count of count0)
if (count > textInput.length/2)
res += 0
else
res += 1
return res
}
gammaInt = binToInt(gamma)
epsilon = {
let res = ""
for (let count of count0)
if (count > textInput.length/2)
res += 1
else
res += 0
return res
}
epsilonInt = binToInt(epsilon)
binToInt = (strBin) => {
let res = 0
strBin.split("").reverse().forEach( (bit, idx) => {
res += bit * (2 ** idx)
})
return res
}
consumption = gammaInt * epsilonInt
oxygen = applyBitCriteria(textInput, "mostCommon")
co2 = applyBitCriteria(textInput, "leastCommon")
function applyBitCriteria( binList, criteria, bitIndex = 0 ) {
if (binList.length === 1)
return binList[0]
let count0 = countAtPos(binList, "0", bitIndex)
switch(criteria) {
case "mostCommon":
if (count0 > binList.length / 2)
return applyBitCriteria(binList.filter( val => val[bitIndex] === "0"), criteria, ++bitIndex)
else
return applyBitCriteria(binList.filter( val => val[bitIndex] === "1"), criteria, ++bitIndex)
break;
case "leastCommon":
if (count0 > binList.length / 2)
return applyBitCriteria(binList.filter( val => val[bitIndex] === "1"), criteria, ++bitIndex)
else
return applyBitCriteria(binList.filter( val => val[bitIndex] === "0"), criteria, ++bitIndex)
break;
default:
return `Error : unknown criteria "${criteria}"`
}
}
oxygenInt = binToInt(oxygen)
co2Int = binToInt(co2)
lifeSupport = oxygenInt * co2Int
entryLength = textInput[0].length
textInput = FileAttachment("03_input.txt").text().then( txt => txt.trim().split("\n"))
Purpose-built for displays of data
Observable is your go-to platform for exploring data and creating expressive data visualizations. Use reactive JavaScript notebooks for prototyping and a collaborative canvas for visual data exploration and dashboard creation.
