{"categories":[],"provider_url":"https://hatena.blog","version":"1.0","description":"\u7279\u306b\u4f55\u3082\u306a\u304f\u30d1\u30bf\u30fc\u30f3\u30de\u30c3\u30c1\u3067\u3084\u3063\u3066\u307e\u3059\u3002 \u30e1\u30e2\u5316\u306f\u307e\u3060\u52c9\u5f37\u4e2d\u3002 lcsLen :: (Eq a) \u21d2 Int \u2192 Int \u2192 [a] \u2192 [a] \u2192 Int lcsLen _ 0 _ _ = 0 lcsLen 0 _ _ _ = 0 lcsLen i j seq1 seq2 | lastSeq1 \u2261 lastSeq2 = 1 + lcsLen (i - 1) (j - 1) nextSeq1 nextSeq2 | otherwise = max (lcsLen (i-1) j nextSeq1 nextSeq2) (lcsLen i (j-1) nextSeq1 nextSeq2) where\u2026","blog_title":"Let's write \u03b2","blog_url":"https://tech-blog.pocket7878.com/","url":"https://tech-blog.pocket7878.com/entry/20120716/1342412742","image_url":null,"title":"Haskell\u3067LCS","author_name":"Pocket7878_dev","author_url":"https://blog.hatena.ne.jp/Pocket7878_dev/","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Ftech-blog.pocket7878.com%2Fentry%2F20120716%2F1342412742\" title=\"Haskell\u3067LCS - Let&#39;s write \u03b2\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","width":"100%","published":"2012-07-16 13:25:42","type":"rich","height":"190","provider_name":"Hatena Blog"}