{"componentChunkName":"component---src-lekoarts-gatsby-theme-minimal-blog-core-templates-blog-query-tsx","path":"/blog","result":{"data":{"allPost":{"nodes":[{"slug":"/为-gatsby-搭建的博客加速","title":"为 Gatsby 搭建的博客加速","date":"November 10, 2020","tags":null,"excerpt":"如何在 Netlify 部署时发布 NPM 包"},{"slug":"/为-git-设置代理","title":"为 Git 设置代理","date":"October 17, 2020","tags":[{"name":"Tools","slug":"tools"}],"excerpt":"摆脱龟速 git clone"},{"slug":"/两个有序数组的中位数","title":"两个有序数组的中位数","date":"May 15, 2020","tags":[{"name":"LeetCode","slug":"leet-code"}],"excerpt":"要善于利用两个数字都有序这一信息"},{"slug":"/longest-increasing-subsequence-and-patience-game-part-2","title":"Longest Increasing Subsequence And Patience Game(Part2)","date":"April 05, 2020","tags":[{"name":"Algorithm","slug":"algorithm"}],"excerpt":"Implementation of the O(nlogn) solution"},{"slug":"/longest-increasing-subsequence-and-patience-game-part-1","title":"Longest Increasing Subsequence And Patience Game(Part1)","date":"March 31, 2020","tags":[{"name":"Algorithm","slug":"algorithm"}],"excerpt":"Idea behind the O(nlogn) solution"},{"slug":"/integer-partition-with-distinct-parts","title":"Integer Partition With Distinct Parts","date":"January 19, 2020","tags":[{"name":"Algorithm","slug":"algorithm"}],"excerpt":"Number of ways to write an integer as the sum of a decreasing sequence, e.g., 5=4+1=3+2"},{"slug":"/my-favorite-proofs-from-analysis-1","title":"My favorite proofs from Analysis1","date":"December 19, 2019","tags":[{"name":"Math","slug":"math"}],"excerpt":"with intuitions"},{"slug":"/countdown-to-2020","title":"Countdown to 2020","date":"December 13, 2019","tags":[{"name":"Fragments","slug":"fragments"}],"excerpt":"19 days"},{"slug":"/number-of-submatrices-that-sum-to-target","title":"Number of submatrices that sum to target","date":"October 27, 2019","tags":[{"name":"Algorithm","slug":"algorithm"},{"name":"LeetCode","slug":"leet-code"}],"excerpt":"Explanations with pictures"},{"slug":"/ubuntu-18-04-remap-mouse-buttons","title":"Ubuntu 18.04 Remap mouse buttons","date":"August 12, 2019","tags":[{"name":"Ubuntu","slug":"ubuntu"}],"excerpt":"Remap buttons on a *wireless* mouse"},{"slug":"/dot-products-and-projections","title":"Dot products and projections","date":"May 12, 2019","tags":[{"name":"Linear Algebra","slug":"linear-algebra"}],"excerpt":"Why are they related?"},{"slug":"/minimum-spanning-tree","title":"Minimum spanning tree","date":"April 07, 2019","tags":[{"name":"Algorithm","slug":"algorithm"}],"excerpt":"MST has the min max edge"},{"slug":"/stream","title":"Stream","date":"March 25, 2019","tags":[{"name":"Functional Programming","slug":"functional-programming"}],"excerpt":"Infinite data structure"},{"slug":"/binding-closure","title":"Binding & Closure","date":"January 23, 2019","tags":[{"name":"Functional Programming","slug":"functional-programming"}],"excerpt":"Binding != Assignment"},{"slug":"/inductive-data-types","title":"Inductive Data Types","date":"January 21, 2019","tags":[{"name":"Functional Programming","slug":"functional-programming"}],"excerpt":"Tree as an example"},{"slug":"/fold-right-and-fold-left","title":"fold_right and fold_left","date":"January 17, 2019","tags":[{"name":"Functional Programming","slug":"functional-programming"}],"excerpt":"fold in OCaml"}]}},"pageContext":{}}}