擅长:python、mysql、java
<p>在本例中,<code>set</code>一旦数字超过<code>100</code>,它将停止循环,因此它不会永远运行。这实际上是一个相当糟糕的斐波纳契序列,但我会解释,因为它无论如何都是有效的代码。。。在</p>
<pre><code>f0 = 0 # initialize your
f1 = 1 # starting values
set = False
while True:
fn = f0 + f1 # fn is your current fib number
f0 = f1 # advance the second-to-last number
f1 = fn # and the last number
if (fn > 100):
set = True # if your current fib number is above 100, set a flag
# so we don't go another iteration
else:
set = False# otherwise, this should never ever do anything. This
# line of code does nothing but slow down the process
print(fn) # print your current fib number to console
if (set == True): # if that aforementioned flag is set...
break # then break out of the loop. Otherwise, loop.
</code></pre>
<p>不管怎样,我会做:</p>
^{pr2}$