{"componentChunkName":"component---src-templates-blog-post-js","path":"/Algorithm/The_Baum-Sweet_sequence/","result":{"data":{"site":{"siteMetadata":{"title":"JULog","author":"[Ju Chan Hwang]","siteUrl":"https://julog.netlify.app","comment":{"disqusShortName":"","utterances":"JuChanHwang/gatsby-starter-bee"},"sponsor":{"buyMeACoffeeId":"jbee"}}},"markdownRemark":{"id":"c497d08e-d1b6-579d-8ca6-a3ecb3e78e35","excerpt":"문제 설명 The Baum–Sweet sequence is an infinite automatic sequence of s and s defined by the rule: bn = if the binary representation of contains no block of consecutive s of odd length;\nbn = otherwise; for . Define a generator function that sequentially generates the values of…","html":"

문제 설명

\n
\n

The Baum–Sweet sequence is an infinite automatic sequence of 0s and 1s defined by the rule:

\n
\n
\n
\n

bn = 1 if the binary representation of n contains no block of consecutive 0s of odd length;\nbn = 0 otherwise;

\n

for n ≥ 0.

\n

Define a generator function baumSweet that sequentially generates the values of this sequence.

\n
\n
\n
\n

풀이

\n
const getBaumSweet = (n) => {\n  let binaryList = [];\n  let res = 0;\n\n  while (n !== 1) {\n    binaryList.push(n % 2);\n    n = Math.floor(n / 2);\n  }\n  binaryList.push(n);\n  binaryList.reverse();\n\n  for (let i = 0; i < binaryList.length - 1; i++) {\n    switch (binaryList[i]) {\n      case 0:\n        res++;\n        break;\n      case 1:\n        if (res === 1) break;\n    }\n    if (res % 2 === 0) res = 0;\n  }\n  return res === 0;\n};
","frontmatter":{"title":"The Baum-Sweet sequence","date":"August 17, 2020"}}},"pageContext":{"slug":"/Algorithm/The_Baum-Sweet_sequence/","previous":{"fields":{"slug":"/Algorithm/Help_Suzuki_complete_his_chores/"},"frontmatter":{"title":"Help Suzuki complete his chores!","category":"Algorithm","draft":false}},"next":{"fields":{"slug":"/JavaScript/Iteration/"},"frontmatter":{"title":"Iteration","category":"JavaScript","draft":false}}}},"staticQueryHashes":["3128451518","96099027"]}