Fibonacci sequence Java

 </span><span style="color: #0000ff;"&gt;public</span> <span style="color: #0000ff;"&gt;static</span> <span style="color: #0000ff;"&gt;void</span><span style="color: #000000;"&gt; main(String agrs[])
{

</span><span style="color: #0000ff;"&gt;for</span>(<span style="color: #0000ff;"&gt;int</span> j=<span style="color: #800080;"&gt;1</span>;j<=<span style="color: #800080;"&gt;15</span>;j++<span style="color: #000000;"&gt;)
    Sy<a href="https://www.jb51.cc/tag/stem/" target="_blank" class="keywords">stem</a>.</span><span style="color: #0000ff;"&gt;out</span><span style="color: #000000;"&gt;.println(fobi(j));
}

</span><span style="color: #0000ff;"&gt;public</span> <span style="color: #0000ff;"&gt;static</span> <span style="color: #0000ff;"&gt;int</span> fobi(<span style="color: #0000ff;"&gt;int</span><span style="color: #000000;"&gt; i)
{
    </span><span style="color: #0000ff;"&gt;if</span>(i<=<span style="color: #800080;"&gt;2</span>) <span style="color: #0000ff;"&gt;return</span> <span style="color: #800080;"&gt;1</span><span style="color: #000000;"&gt;;

    </span><span style="color: #0000ff;"&gt;return</span> fobi(i-<span style="color: #800080;"&gt;1</span>) + fobi(i-<span style="color: #800080;"&gt;2</span><span style="color: #000000;"&gt;);



}

}

The content of this article comes from the network collection of netizens. It is used as a learning reference. The copyright belongs to the original author.
THE END
分享
二维码
< <上一篇
下一篇>>