資源簡介
這是一個用Java實現符號三角形的算法……
代碼片段和文件信息
public?class?Tringles?{
static?int?nhalfcount;
static?int[][]p;
static?long?sum;
public?static?long?compute(int?nn)
{
n=nn;
count=0;
sum=0;
half=n*(n+1)/2;
if(half%2==1)return?0;
half=half/2;
p=new?int[n+1][n+1];
for(int?i=0;i<=n;i++)
for(int?j=0;j<=n;j++)p[i][j]=0;
backtrack(1);
return?sum;
}
private?static?void?backtrack(int?t)
{
if((count>half)||(t*(t-1)/2-count>half))return?;
if(t>n){
sum++;
System.out.println(sum);
for(int?i=1;i<=n;i++)
{
for?(int?k?=?1;?k?
- 上一篇:Java實現圖的m著色問題算法
- 下一篇:JSP網上訂票系統
評論
共有 條評論