import java.io.*;
import java.util.*;
public class secret{
int [] c1=new int[500];
int [] c2=new int[500];
char [] c3=new char[500];
char [] c4=new char[500];
String a;
int n;
public secret(){}
public int move()
{
System.out.print("输入解密移动的位数: ");
Scanner ss=new Scanner(System.in );
n=ss.nextInt();
return n;
}
public char[] addsecret(int a[]){
for(int i=0;a[i]!='\0';i++){
if(a[i]>='A'&&a[i]<='Z')
c1[i]='A'+(a[i]-'A'+n)%26;
else if(a[i]>='a'&&a[i]<='z')
c1[i]='a'+(a[i]-'a'+n)%26;
else
c1[i]=a[i];
}
for(int i=0;c1[i]!='\0';i++)
{
c3[i]=(char)c1[i];
}
return c3;
}
public char[] jiesecret(int b[]){
for(int j=0;b[j]!='\0';j++){
if(b[j]>='A'&&b[j]<='Z')
c2[j]='A'+(b[j]-'A'+26-n)%26;
else if(b[j]>='a'&&b[j]<='z')
c2[j]='a'+(b[j]-'a'+26-n)%26;
else
c2[j]=b[j];
}
for(int i=0;c2[i]!='\0';i++)
{
c4[i]=(char)c2[i];
}
return c4;
}
}



java socket编程(循环加密算法)

prophecy
