https://fgchen.com/wiki/index.php?action=history&feed=atom&title=SCJP_1.6%E7%89%88%E8%80%83%E9%A1%8C_138 2026-04-27T06:58:28Z 本 Wiki 上此頁面的修訂歷史 MediaWiki 1.29.0 https://fgchen.com/wiki/index.php?title=SCJP_1.6%E7%89%88%E8%80%83%E9%A1%8C_138&diff=1282&oldid=prev 2013-03-30T03:22:04Z

<p>新頁面: Which two code fragments are most likely to cause a StackOverflowError? (Choose two.) A. int[] x = {1, 2, 3, 4, 5}; for(int y=0; y&lt;6; y++) System.out.println(x[y]); ...</p> <p><b>新頁面</b></p><div> Which two code fragments are most likely to cause a StackOverflowError? (Choose two.)<br /> A. int[] x = {1, 2, 3, 4, 5};<br /> for(int y=0; y&lt;6; y++)<br /> System.out.println(x[y]);<br /> B. static int[] x = {7, 6, 54};<br /> static{x[1] = 8; x[4] = 3;}<br /> C. for(int y=10; y&lt;10; y++)<br /> doStuff(y);<br /> D. void doOne(int x){doTwo(x);}<br /> void doTwo(int y){doThree(y);}<br /> void doThree(int z){doTwo(z);}<br /> E. for(int x=0; x&lt;1000000000; x++)<br /> doStuff(x);<br /> F. void counter(int i){counter(++i);}<br /> <br /> &lt;div class=&quot;toccolours mw-collapsible mw-collapsed&quot;&gt;<br /> &lt;span style=&quot;font-size:medium;&quot;&gt;解答&lt;/span&gt;<br /> <br /> ----<br /> &lt;div class=&quot;mw-collapsible-content&quot;&gt;<br /> &lt;span style=&quot;font-size: medium;&quot;&gt;Ans: D F &lt;/span&gt;<br /> <br /> &lt;span style=&quot;font-size:medium;&quot;&gt; 解說:<br /> 此題問那個敘述最可能發生StackOverflowError 堆疊溢位錯誤<br /> D 是doTwo和doThree二個方法間無條件地呼叫彼此(間接遞迴)，沒有停止條件，一個方法若無盡地被呼叫，<br /> 會持續在呼叫堆疊中配置出所需要方法變數空間，一直到堆疊空間滿了(堆疊溢出)<br /> F 也是同樣的意思 無條件式的直接遞迴，沒有停止…<br /> <br /> &lt;/span&gt; <br /> &lt;/div&gt;&lt;/div&gt;<br /> {{SCJP 1.6版考題講解}}</div>

Ikk