{"categories":["LeetCode"],"width":"100%","author_url":"https://blog.hatena.ne.jp/mhiro216/","version":"1.0","author_name":"mhiro216","url":"https://mhiro216.hatenablog.com/entry/2019/08/17/103553","provider_url":"https://hatena.blog","height":"190","image_url":"https://chart.apis.google.com/chart?cht=tx&chl=%20O%28n%20%2A%20h%29","type":"rich","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fmhiro216.hatenablog.com%2Fentry%2F2019%2F08%2F17%2F103553\" title=\"LeetCode / Linked List Cycle - \u30aa\u30c3\u30c8\u30bb\u30a4\u306e\u7d4c\u55b6\u65e5\u8a8c\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","provider_name":"Hatena Blog","published":"2019-08-17 10:35:53","title":"LeetCode / Linked List Cycle","blog_title":"\u30aa\u30c3\u30c8\u30bb\u30a4\u306e\u7d4c\u55b6\u65e5\u8a8c","blog_url":"https://mhiro216.hatenablog.com/","description":"Kaggle\u7e4b\u304c\u308a\u3067Twitter\u3067\u3070\u3063\u305f\u308a\u30d5\u30a9\u30ed\u30fc\u3057\u305f\u4eba\u304c\u3070\u3063\u305f\u308a\u65e7\u77e5\u306e\u56f2\u7881\u53cb\u3060\u3063\u305f\u4ef6\u3002 \u3061\u3087\u3046\u3069\u4eca\u65e5\u306e\u554f\u984c\u306eLinked List\u306e\u3088\u3046\u306b\u3050\u308b\u308a\u3068\u56de\u3063\u3066\u518d\u4f1a\u3057\u307e\u3057\u305f\uff08\u7121\u7406\u77e2\u7406 https://leetcode.com/problems/linked-list-cycle/ Given a linked list, determine if it has a cycle in it. To represent a cycle in the given linked list, we use an integer pos which represents the position (0-ind\u2026"}