신호와 잡음

코드 출현 2016 6일 차

1 부

괜찮아요!

Split the input at each newline character into an array of strings
For each string, accumulate an array with as many empty objects as there are characters in the string
  Split each string into an array of characters
  For each character
    Increment the number associated with the character key in the object at the same index in the accumulating array as the character's in the string
For each object, accumulate a string
  The next character is the one who's key is associated with the largest number among all the keys in that object
Return the accumulated string

input.reduce(
 (counts, line) => {
  line.split('')
   .forEach(
    (char, i) => counts[i][char] = (counts[i][char] || 0) + 1
   )
  return counts
 }, new Array(stream[0].length).fill(null)
                               .map(el => Object.create({}))
).reduce(
 (message, tallies) => {
   return message += Object.entries(tallies)
    .find(
       (el) => el[1] == Math.max(...Object.values(tallies))
    )[0]
 }, ""
)

2 부

최대값을 최소값으로 변경

function bothParts(fn) {
 input.reduce(
  (counts, line) => {
   line.split('')
    .forEach(
     (char, i) => counts[i][char] = (counts[i][char] || 0) + 1
    )
   return counts
  }, new Array(stream[0].length).fill(null)
                                .map(el => Object.create({}))
 ).reduce(
  (message, tallies) => {
    return message += Object.entries(tallies)
     .find(
        (el) => el[1] == fn(...Object.values(tallies))
     )[0]
  }, ""
 )
}
// Part 1: bothParts(Math.max)
// Part 2: bothParts(Math.min)

해냈어!!