基于Java Map的素数方阵求解优化

A Study of Optimization on Solving of Prime Matrices Based on Java Map

通过精简集合样本数、从数字拆分中删除new操作、加快方阵旋转、使用映射替换集合以及检测与消除无效组合等手段,使得优化后的算法运行时间在7阶时能够缩短为原来的约1/2200。

By downsizing the sample numbers,removing the new operation from integer splitting,quickening the matrix rotation,detecting and eliminating the invalid combination and replacing the set with map,the running time of the optimized algorithm can be reduced to about 1/2200 of the original at the 7th stage.