{
    "componentChunkName": "component---src-templates-tag-blog-list-js",
    "path": "/tag/Algorithm",
    "result": {"data":{"allMdx":{"edges":[{"node":{"fields":{"slug":"/posts/2017/09/28/yue-se-fu-huan-shi-xian/"},"frontmatter":{"title":"约瑟夫环","date":"2017-09-28T19:12:00.000Z","categories":["Blog"],"tags":["Algorithm"]},"excerpt":"今天上数据结构实验课，有道题是约瑟夫环，感觉挺好玩的，就拿出来总结一下（今天的LeetCode那道题真的是太Easy了）。 约瑟夫环是一个数学的应用问题：已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m…"}},{"node":{"fields":{"slug":"/posts/2017/09/19/lian-biao-pai-xu/"},"frontmatter":{"title":"链表排序","date":"2017-09-19 13:45","categories":["Blog"],"tags":["Algorithm"]},"excerpt":"今天中午在 Lintcode 上刷了一道题—— 链表排序 题目很短： 在 O( n  log  n…"}}]}},"pageContext":{"tag":"Algorithm","pageNumber":0,"humanPageNumber":1,"skip":0,"limit":6,"numberOfPages":1,"previousPagePath":"","nextPagePath":""}},
    "staticQueryHashes": ["163584858","1656825683","63159454"]}