展开全部
基本实现:636f70793231313335323631343130323136353331333332616363public class SSS {
private int i = 0;
private int[] sz = new int[10000];
public void init() {
for (int i = 0; i < 10000; i++) {
sz[i] = i;
}
new Thread(new Runnable() {
@Override
public void run() {
while (true) {
try {
// int now=(int)Math.round(Math.random()*(1000-0)+0);
// if(now>i){
// i=now;
System.out.println(sz[i]);
i++;
// }
Thread.sleep(1000);
} catch (InterruptedException e) {
e.printStackTrace();
}
}
}
}).start();
}
public static void main(String[] args) {
new SSS().init();
}
}