<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>rare_Remrin</author_name>
  <author_url>https://blog.hatena.ne.jp/rare_Remrin/</author_url>
  <blog_title>Remrinのpython攻略日記</blog_title>
  <blog_url>https://python-remrin.hatenadiary.jp/</blog_url>
  <categories>
    <anon>アルゴリズム</anon>
    <anon>python</anon>
  </categories>
  <description>フィボナッチ数列について。 def fib(n): a, b = 0, 1 for i in range(n): a, b = b, a + b return b print([fib(i) for i in range(10)]) # [1, 1, 2, 3, 5, 8, 13, 21, 34, 55] メモ化した場合 fib_memo = {} def fib(n): if n &lt; 3: return 1 if n not in fib_memo: fib_memo[n] = fib(n-1) + fib(n-2) return fib_memo[n] print(fib(10)) # 5…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Fpython-remrin.hatenadiary.jp%2Fentry%2F2017%2F05%2F19%2F153228&quot; title=&quot;フィボナッチ数列 - Remrinのpython攻略日記&quot; class=&quot;embed-card embed-blogcard&quot; scrolling=&quot;no&quot; frameborder=&quot;0&quot; style=&quot;display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;&quot;&gt;&lt;/iframe&gt;</html>
  <image_url>https://cdn-ak.f.st-hatena.com/images/fotolife/r/rare_Remrin/20170519/20170519152551.png</image_url>
  <provider_name>Hatena Blog</provider_name>
  <provider_url>https://hatena.blog</provider_url>
  <published>2017-05-19 15:32:28</published>
  <title>フィボナッチ数列</title>
  <type>rich</type>
  <url>https://python-remrin.hatenadiary.jp/entry/2017/05/19/153228</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
