()
| 22 | public static boolean zero1; |
| 23 | |
| 24 | public static void compute1() { |
| 25 | zero1 = false; |
| 26 | for (int i = 1; i <= n; i++) { |
| 27 | if (!insert(arr[i])) { |
| 28 | zero1 = true; |
| 29 | } |
| 30 | } |
| 31 | } |
| 32 | |
| 33 | // 线性基里插入num，如果线性基增加了返回true，否则返回false |
| 34 | public static boolean insert(long num) { |