我改了一下,好象可以了public class lan
{
int[] conversion(char character)
{ int a[]; a=new int[25];
int i;
switch(character)
{case 'a':
case 'A': int []aa={0,1,1,1,0,1,0,0,0,1,1,1,1,1,1,1,0,0,0,1,1,0,0,0,1};
for(i=0;i<25;i++)
a[i]=aa[i];break;
case 'b':
case 'B':int []bb={1,1,1,1,1,1,0,0,0,1,1,1,1,1,1,1,0,0,0,1,1,1,1,1,1};
for(i=0;i<25;i++)
a[i]=bb[i];break;
case 'c':
case 'C':int []cc={0,1,1,1,1,1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,0,1,1,1,1};
for(i=0;i<25;i++)
a[i]=cc[i];break;
case 'd':
case 'D':int []dd={1,1,1,1,0,1,0,0,0,1,1,0,0,0,1,1,0,0,0,1,1,1,1,1,0};
for(i=0;i<25;i++)
a[i]=dd[i];break;
case 'e':
case 'E':int []ee={1,1,1,1,1,1,0,0,0,0,1,1,1,1,1,1,0,0,0,0,1,1,1,1,1};
for(i=0;i<25;i++)
a[i]=ee[i];break;
case 'f':
case 'F':int []ff={1,1,1,1,1,1,0,0,0,0,1,1,1,1,1,1,0,0,0,0,1,0,0,0,0};
for(i=0;i<25;i++)
a[i]=ff[i];break;
case 'g':
case 'G':int []gg={1,1,1,1,1,1,0,0,0,0,1,1,1,1,1,1,0,0,0,1,1,1,1,1,1};
for(i=0;i<25;i++)
a[i]=gg[i];break;
case 'h':
case 'H':int []hh={1,0,0,0,1,1,0,0,0,1,1,1,1,1,1,1,0,0,0,1,1,0,0,0,1};
for(i=0;i<25;i++)
a[i]=hh[i];break;
case 'i':
case 'I':int []ii={0,0,1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0};
for(i=0;i<25;i++)
a[i]=ii[i];break;
case 'j':
case 'J':int []jj={1,1,1,1,1,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0,1,1,1,0,0};
for(i=0;i<25;i++)
a[i]=jj[i];break;
case 'k':
case 'K':int []kk={1,0,0,0,1,1,0,0,1,0,1,1,0,0,0,1,0,0,1,0,1,0,0,0,1};
for(i=0;i<25;i++)
a[i]=kk[i];break;
case 'l':
case 'L':int []ll={1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,1,1,1,1,1};
for(i=0;i<25;i++)
a[i]=ll[i];break;
case 'm':
case 'M':int []mm={1,0,0,0,1,1,1,0,1,1,1,0,1,0,1,1,0,0,0,1,1,0,0,0,1};
for(i=0;i<25;i++)
a[i]=mm[i];break;
case 'n':
case 'N':int []nn={1,0,0,0,1,1,1,0,0,1,1,0,1,0,1,1,0,0,1,1,1,0,0,0,1};
for(i=0;i<25;i++)
a[i]=nn[i];break;
case 'o':
case 'O':int []oo={0,1,1,1,0,1,0,0,0,1,1,0,0,0,1,1,0,0,0,1,0,1,1,1,0};
for(i=0;i<25;i++)
a[i]=oo[i];break;
case 'p':
case 'P':int []pp={1,1,1,1,1,1,0,0,0,1,1,1,1,1,1,1,0,0,0,0,1,0,0,0,0};
for(i=0;i<25;i++)
a[i]=pp[i];break;
case 'q':
case 'Q':int []qq={1,1,1,1,1,1,0,0,0,1,1,1,1,1,1,0,0,0,0,1,0,0,0,0,1};
for(i=0;i<25;i++)
a[i]=qq[i];break;
case 'r':
case 'R':int []rr={1,1,1,1,0,1,0,0,0,1,1,1,1,1,1,1,0,1,0,0,1,0,0,0,1};
for(i=0;i<25;i++)
a[i]=rr[i];break;
case 's':
case 'S':int []ss={1,1,1,1,1,1,0,0,0,0,1,1,1,1,1,0,0,0,0,1,1,1,1,1,1};
for(i=0;i<25;i++)
a[i]=ss[i];break;
case 't':
case 'T':int []tt={1,1,1,1,1,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0};
for(i=0;i<25;i++)
a[i]=tt[i];break;
case 'u':
case 'U':int []uu={1,0,0,0,1,1,0,0,0,1,1,0,0,0,1,1,0,0,0,1,0,1,1,1,0};
for(i=0;i<25;i++)
a[i]=uu[i];break;
case 'v':
case 'V':int []vv={1,0,0,0,1,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,1,0,0};
for(i=0;i<25;i++)
a[i]=vv[i];break;
case 'w':
case 'W':int []ww={1,0,1,0,1,0,1,0,1,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0};
for(i=0;i<25;i++)
a[i]=ww[i];break;
case 'x':
case 'X':int []xx={1,0,0,0,1,0,1,0,1,0,0,0,1,0,0,0,1,0,1,0,1,0,0,0,1};
for(i=0;i<25;i++)
a[i]=xx[i];break;
case 'y':
case 'Y': int []yy={1,0,0,0,1,0,1,0,1,0,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0};
for(i=0;i<25;i++)
a[i]=yy[i];break;
case 'z':
case 'Z': int []zz={1,1,1,1,1,0,0,0,1,0,0,0,1,0,0,0,1,0,0,0,1,1,1,1,1};
for(i=0;i<25;i++)
a[i]=zz[i];break;
default:int []others={0};
for(i=0;i<25;i++)
a[i]=others[i];break;
}
return a;
}
public static void main(String args[])
{
int ox=2,len=0;
int a[]; a=new int[25];
int c[][]; c=new int[5][5];
String s=args[0];
int n=0,i,j=0,m1=0,j1=0,i1=0,n1=0;
char b[]=s.toCharArray();
char b1[]=new char[b.length-12];
if(b.length>12)
for(i=13;i<b.length;i++)
b1[i-13]=b[i];
lan qianxun=new lan();
len=b.length;
System.out.println("您输入的字符串的长度是:"+b.length);
while(ox>0)
{
for(i=0;i<5;i++)
{
for(;j<len;j++)
{
if(j==13)
{
break;
}
a=qianxun.conversion(b[j]);
for(j1=0;j1<5;j1++)
{
for(i1=0;i1<5;i1++)
{
c[j1][i1]=a[m1];
m1++;
}
}
m1=0;
n1++;
for(n=0;n<5;n++)
if(c[i][n]==1)
System.out.print("*");
else System.out.print(" ");
System.out.print(" ");
}
j=0;n1=0;
System.out.println("");
}
System.out.println("");
ox--;
for(i=0;i<b1.length;i++)
b[i]=b1[i];
len=b1.length-1;
}
}
}
{
int[] conversion(char character)
{ int a[]; a=new int[25];
int i;
switch(character)
{case 'a':
case 'A': int []aa={0,1,1,1,0,1,0,0,0,1,1,1,1,1,1,1,0,0,0,1,1,0,0,0,1};
for(i=0;i<25;i++)
a[i]=aa[i];break;
case 'b':
case 'B':int []bb={1,1,1,1,1,1,0,0,0,1,1,1,1,1,1,1,0,0,0,1,1,1,1,1,1};
for(i=0;i<25;i++)
a[i]=bb[i];break;
case 'c':
case 'C':int []cc={0,1,1,1,1,1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,0,1,1,1,1};
for(i=0;i<25;i++)
a[i]=cc[i];break;
case 'd':
case 'D':int []dd={1,1,1,1,0,1,0,0,0,1,1,0,0,0,1,1,0,0,0,1,1,1,1,1,0};
for(i=0;i<25;i++)
a[i]=dd[i];break;
case 'e':
case 'E':int []ee={1,1,1,1,1,1,0,0,0,0,1,1,1,1,1,1,0,0,0,0,1,1,1,1,1};
for(i=0;i<25;i++)
a[i]=ee[i];break;
case 'f':
case 'F':int []ff={1,1,1,1,1,1,0,0,0,0,1,1,1,1,1,1,0,0,0,0,1,0,0,0,0};
for(i=0;i<25;i++)
a[i]=ff[i];break;
case 'g':
case 'G':int []gg={1,1,1,1,1,1,0,0,0,0,1,1,1,1,1,1,0,0,0,1,1,1,1,1,1};
for(i=0;i<25;i++)
a[i]=gg[i];break;
case 'h':
case 'H':int []hh={1,0,0,0,1,1,0,0,0,1,1,1,1,1,1,1,0,0,0,1,1,0,0,0,1};
for(i=0;i<25;i++)
a[i]=hh[i];break;
case 'i':
case 'I':int []ii={0,0,1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0};
for(i=0;i<25;i++)
a[i]=ii[i];break;
case 'j':
case 'J':int []jj={1,1,1,1,1,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0,1,1,1,0,0};
for(i=0;i<25;i++)
a[i]=jj[i];break;
case 'k':
case 'K':int []kk={1,0,0,0,1,1,0,0,1,0,1,1,0,0,0,1,0,0,1,0,1,0,0,0,1};
for(i=0;i<25;i++)
a[i]=kk[i];break;
case 'l':
case 'L':int []ll={1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,1,1,1,1,1};
for(i=0;i<25;i++)
a[i]=ll[i];break;
case 'm':
case 'M':int []mm={1,0,0,0,1,1,1,0,1,1,1,0,1,0,1,1,0,0,0,1,1,0,0,0,1};
for(i=0;i<25;i++)
a[i]=mm[i];break;
case 'n':
case 'N':int []nn={1,0,0,0,1,1,1,0,0,1,1,0,1,0,1,1,0,0,1,1,1,0,0,0,1};
for(i=0;i<25;i++)
a[i]=nn[i];break;
case 'o':
case 'O':int []oo={0,1,1,1,0,1,0,0,0,1,1,0,0,0,1,1,0,0,0,1,0,1,1,1,0};
for(i=0;i<25;i++)
a[i]=oo[i];break;
case 'p':
case 'P':int []pp={1,1,1,1,1,1,0,0,0,1,1,1,1,1,1,1,0,0,0,0,1,0,0,0,0};
for(i=0;i<25;i++)
a[i]=pp[i];break;
case 'q':
case 'Q':int []qq={1,1,1,1,1,1,0,0,0,1,1,1,1,1,1,0,0,0,0,1,0,0,0,0,1};
for(i=0;i<25;i++)
a[i]=qq[i];break;
case 'r':
case 'R':int []rr={1,1,1,1,0,1,0,0,0,1,1,1,1,1,1,1,0,1,0,0,1,0,0,0,1};
for(i=0;i<25;i++)
a[i]=rr[i];break;
case 's':
case 'S':int []ss={1,1,1,1,1,1,0,0,0,0,1,1,1,1,1,0,0,0,0,1,1,1,1,1,1};
for(i=0;i<25;i++)
a[i]=ss[i];break;
case 't':
case 'T':int []tt={1,1,1,1,1,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0};
for(i=0;i<25;i++)
a[i]=tt[i];break;
case 'u':
case 'U':int []uu={1,0,0,0,1,1,0,0,0,1,1,0,0,0,1,1,0,0,0,1,0,1,1,1,0};
for(i=0;i<25;i++)
a[i]=uu[i];break;
case 'v':
case 'V':int []vv={1,0,0,0,1,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,1,0,0};
for(i=0;i<25;i++)
a[i]=vv[i];break;
case 'w':
case 'W':int []ww={1,0,1,0,1,0,1,0,1,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0};
for(i=0;i<25;i++)
a[i]=ww[i];break;
case 'x':
case 'X':int []xx={1,0,0,0,1,0,1,0,1,0,0,0,1,0,0,0,1,0,1,0,1,0,0,0,1};
for(i=0;i<25;i++)
a[i]=xx[i];break;
case 'y':
case 'Y': int []yy={1,0,0,0,1,0,1,0,1,0,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0};
for(i=0;i<25;i++)
a[i]=yy[i];break;
case 'z':
case 'Z': int []zz={1,1,1,1,1,0,0,0,1,0,0,0,1,0,0,0,1,0,0,0,1,1,1,1,1};
for(i=0;i<25;i++)
a[i]=zz[i];break;
default:int []others={0};
for(i=0;i<25;i++)
a[i]=others[i];break;
}
return a;
}
public static void main(String args[])
{
int ox=2,len=0;
int a[]; a=new int[25];
int c[][]; c=new int[5][5];
String s=args[0];
int n=0,i,j=0,m1=0,j1=0,i1=0,n1=0;
char b[]=s.toCharArray();
char b1[]=new char[b.length-12];
if(b.length>12)
for(i=13;i<b.length;i++)
b1[i-13]=b[i];
lan qianxun=new lan();
len=b.length;
System.out.println("您输入的字符串的长度是:"+b.length);
while(ox>0)
{
for(i=0;i<5;i++)
{
for(;j<len;j++)
{
if(j==13)
{
break;
}
a=qianxun.conversion(b[j]);
for(j1=0;j1<5;j1++)
{
for(i1=0;i1<5;i1++)
{
c[j1][i1]=a[m1];
m1++;
}
}
m1=0;
n1++;
for(n=0;n<5;n++)
if(c[i][n]==1)
System.out.print("*");
else System.out.print(" ");
System.out.print(" ");
}
j=0;n1=0;
System.out.println("");
}
System.out.println("");
ox--;
for(i=0;i<b1.length;i++)
b[i]=b1[i];
len=b1.length-1;
}
}
}
public class lan
{
int[] conversion(char character)
{ int a[]; a=new int[25];
int i;
switch(character)
{case 'a':
case 'A': int []aa={0,1,1,1,0,1,0,0,0,1,1,1,1,1,1,1,0,0,0,1,1,0,0,0,1};
for(i=0;i<25;i++)
a[i]=aa[i];break;
case 'b':
case 'B':int []bb={1,1,1,1,1,1,0,0,0,1,1,1,1,1,1,1,0,0,0,1,1,1,1,1,1};
for(i=0;i<25;i++)
a[i]=bb[i];break;
case 'c':
case 'C':int []cc={0,1,1,1,1,1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,0,1,1,1,1};
for(i=0;i<25;i++)
a[i]=cc[i];break;
case 'd':
case 'D':int []dd={1,1,1,1,0,1,0,0,0,1,1,0,0,0,1,1,0,0,0,1,1,1,1,1,0};
for(i=0;i<25;i++)
a[i]=dd[i];break;
case 'e':
case 'E':int []ee={1,1,1,1,1,1,0,0,0,0,1,1,1,1,1,1,0,0,0,0,1,1,1,1,1};
for(i=0;i<25;i++)
a[i]=ee[i];break;
case 'f':
case 'F':int []ff={1,1,1,1,1,1,0,0,0,0,1,1,1,1,1,1,0,0,0,0,1,0,0,0,0};
for(i=0;i<25;i++)
a[i]=ff[i];break;
case 'g':
case 'G':int []gg={1,1,1,1,1,1,0,0,0,0,1,1,1,1,1,1,0,0,0,1,1,1,1,1,1};
for(i=0;i<25;i++)
a[i]=gg[i];break;
case 'h':
case 'H':int []hh={1,0,0,0,1,1,0,0,0,1,1,1,1,1,1,1,0,0,0,1,1,0,0,0,1};
for(i=0;i<25;i++)
a[i]=hh[i];break;
case 'i':
case 'I':int []ii={0,0,1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0};
for(i=0;i<25;i++)
a[i]=ii[i];break;
case 'j':
case 'J':int []jj={1,1,1,1,1,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0,1,1,1,0,0};
for(i=0;i<25;i++)
a[i]=jj[i];break;
case 'k':
case 'K':int []kk={1,0,0,0,1,1,0,0,1,0,1,1,0,0,0,1,0,0,1,0,1,0,0,0,1};
for(i=0;i<25;i++)
a[i]=kk[i];break;
case 'l':
case 'L':int []ll={1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,1,1,1,1,1};
for(i=0;i<25;i++)
a[i]=ll[i];break;
case 'm':
case 'M':int []mm={1,0,0,0,1,1,1,0,1,1,1,0,1,0,1,1,0,0,0,1,1,0,0,0,1};
for(i=0;i<25;i++)
a[i]=mm[i];break;
case 'n':
case 'N':int []nn={1,0,0,0,1,1,1,0,0,1,1,0,1,0,1,1,0,0,1,1,1,0,0,0,1};
for(i=0;i<25;i++)
a[i]=nn[i];break;
case 'o':
case 'O':int []oo={0,1,1,1,0,1,0,0,0,1,1,0,0,0,1,1,0,0,0,1,0,1,1,1,0};
for(i=0;i<25;i++)
a[i]=oo[i];break;
case 'p':
case 'P':int []pp={1,1,1,1,1,1,0,0,0,1,1,1,1,1,1,1,0,0,0,0,1,0,0,0,0};
for(i=0;i<25;i++)
a[i]=pp[i];break;
case 'q':
case 'Q':int []qq={1,1,1,1,1,1,0,0,0,1,1,1,1,1,1,0,0,0,0,1,0,0,0,0,1};
for(i=0;i<25;i++)
a[i]=qq[i];break;
case 'r':
case 'R':int []rr={1,1,1,1,0,1,0,0,0,1,1,1,1,1,1,1,0,1,0,0,1,0,0,0,1};
for(i=0;i<25;i++)
a[i]=rr[i];break;
case 's':
case 'S':int []ss={1,1,1,1,1,1,0,0,0,0,1,1,1,1,1,0,0,0,0,1,1,1,1,1,1};
for(i=0;i<25;i++)
a[i]=ss[i];break;
case 't':
case 'T':int []tt={1,1,1,1,1,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0};
for(i=0;i<25;i++)
a[i]=tt[i];break;
case 'u':
case 'U':int []uu={1,0,0,0,1,1,0,0,0,1,1,0,0,0,1,1,0,0,0,1,0,1,1,1,0};
for(i=0;i<25;i++)
a[i]=uu[i];break;
case 'v':
case 'V':int []vv={1,0,0,0,1,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,1,0,0};
for(i=0;i<25;i++)
a[i]=vv[i];break;
case 'w':
case 'W':int []ww={1,0,1,0,1,0,1,0,1,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0};
for(i=0;i<25;i++)
a[i]=ww[i];break;
case 'x':
case 'X':int []xx={1,0,0,0,1,0,1,0,1,0,0,0,1,0,0,0,1,0,1,0,1,0,0,0,1};
for(i=0;i<25;i++)
a[i]=xx[i];break;
case 'y':
case 'Y': int []yy={1,0,0,0,1,0,1,0,1,0,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0};
for(i=0;i<25;i++)
a[i]=yy[i];break;
case 'z':
case 'Z': int []zz={1,1,1,1,1,0,0,0,1,0,0,0,1,0,0,0,1,0,0,0,1,1,1,1,1};
for(i=0;i<25;i++)
a[i]=zz[i];break;
default:int []others={0};
for(i=0;i<25;i++)
a[i]=others[i];break;
}
return a;
}
public static void main(String args[])
{
boolean flag=true;
int ox=2,len=0;
int a[]; a=new int[25];
int c[][]; c=new int[5][5];
String s=args[0];
int n=0,i,j=0,m1=0,j1=0,i1=0,n1=0;
char b[]=s.toCharArray();
lan qianxun=new lan();
len=b.length;
System.out.println("您输入的字符串的长度是:"+b.length);
while(ox>0)
{
for(i=0;i<5;i++)
{
for(;j<len;j++)
{
if(j==13)
{
flag=false;
break;
}
a=qianxun.conversion(b[j]);
for(j1=0;j1<5;j1++)
{
for(i1=0;i1<5;i1++)
{
c[j1][i1]=a[m1];
m1++;
}
}
m1=0;
n1++;
for(n=0;n<5;n++)
if(c[i][n]==1)
System.out.print("*");
else System.out.print(" ");
System.out.print(" ");
}
j=0;n1=0;
System.out.println("");
}
if(flag==false)
{
System.out.println("");
ox--;
for(i=13;i<b.length;i++)
b[i-13]=b[i];
len=b.length-13;
}
else
ox=ox-2;
}
}
}
int ox=b.length/13+1;
把这改一下
if(flag==false)
{
System.out.println("");
ox--;
for(i=13;i<b.length;i++)
b[i-13]=b[i];
len=len-13;
flag=true;
}