{"published":"2011-05-22 02:56:43","categories":["programming","ruby","programming","ruby"],"url":"https://sylph01a.hatenablog.jp/entry/20110522/1306087003","author_url":"https://blog.hatena.ne.jp/sylph01/","provider_url":"https://hatena.blog","version":"1.0","image_url":null,"height":"190","provider_name":"Hatena Blog","author_name":"sylph01","blog_title":"\u305d\u3093\u306a\u3053\u3068\u306f\u3055\u3066\u304a\u3044\u3066(archive)","type":"rich","description":"\u30aa\u30d6\u30b8\u30a7\u30af\u30c8\u6307\u5411\u306a\u3089\u3042\u3093\u306a\u66f8\u304d\u65b9\u3057\u306d\u3048\u3088\u3001\u3068\u3044\u3046\u3053\u3068\u3067\u4fee\u6b63\u3002Array\u306b\u5bfe\u3057\u3066\u30e1\u30bd\u30c3\u30c9\u3092\u8ffd\u52a0\u3059\u308b\u65b9\u6cd5\u3067\u3002 class Array def deletemin_comp x a = self.dup a.sort! for i in 0 .. a.size - 1 if a[i] > x self.delete_at(self.index(a[i])) return a[i] end end return nil end def returnmin_comp x a = self.dup a.sort! for i in 0 .. a.size - 1 if a[i] > x return a[\u2026","blog_url":"https://sylph01a.hatenablog.jp/","width":"100%","title":"","html":""}