给某个玩家100元的资本，让他不停押注直到输光，计算需要*多少次？

如果把次数放在数组ruinLength[]中，进行1000次实验后，看看破产的最大次数、

最小次数和平均次数分别是多少？-100 to a player' s capital, so that he kept until the bet输光to calculate how many times the need for gambling? If the number on the array ruinLength [] in experiments carried out after 1000 to see the largest number of bankruptcy, the minimum number and the average number of how many were?