{"url":"https://obelisk.hatenablog.com/entry/2016/02/17/093022","width":"100%","categories":["Ruby","\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0"],"html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fobelisk.hatenablog.com%2Fentry%2F2016%2F02%2F17%2F093022\" title=\"\u30d2\u30fc\u30d7\u30bd\u30fc\u30c8 - Camera Obscura\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","author_url":"https://blog.hatena.ne.jp/obelisk2/","description":"\u7834\u58ca\u7684\u30e1\u30bd\u30c3\u30c9\u306b\u306a\u308a\u307e\u3059\u3002 class Array #\u8981\u7d20i\u304b\u3089\u4e0b\u3078\u3001max\u30d2\u30fc\u30d7\u72b6\u614b\u304c\u6e80\u305f\u3055\u308c\u308b\u3088\u3046\u306bself\u3092\u4fee\u5fa9\u3059\u308b def max_heapify(i) l = 2 * i + 1 r = l + 1 largest = (l <= @heap_size - 1 and self[l] > self[i]) ? l : i largest = r if r <= @heap_size - 1 and self[r] > self[largest] return if largest == i self[i], self[largest] = self[largest], self[i]\u2026","blog_title":"Camera Obscura","image_url":"http://ecx.images-amazon.com/images/I/51foeCpfmQL.jpg","height":"190","provider_name":"Hatena Blog","published":"2016-02-17 09:30:22","type":"rich","blog_url":"https://obelisk.hatenablog.com/","author_name":"obelisk2","title":"\u30d2\u30fc\u30d7\u30bd\u30fc\u30c8","provider_url":"https://hatena.blog","version":"1.0"}