某系统的数字密码(大于0)。比如1983,采用加密方式进行传输,规则如下:
每位数加上5再对10求余,最后将所有数字反转,得到一串新数。
import java.util.Scanner;
public class HelloWorld {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入数字密码:");
int number = sc.nextInt();
int weishu=getweishu(number);
int[] array=getnumber(number);
array=plusnumber(array,5);
array=modnumber(array);
int newnumber=reversenumber(array);
System.out.println(newnumber);
}
public static int getweishu(int number){
int temp=number;
int result=0;
while(temp>0){
result++;
temp=temp/10;
}
return result;
}
public static int[] getnumber(int number){
int temp=number;
int[] arr=new int[getweishu(number)];
for (int i = 0; i < arr.length; i++) {
arr[i]=temp%10;
temp=temp/10;
}
return arr;
}
public static int[] plusnumber(int[] arr,int number){
for (int i = 0; i < arr.length; i++) {
arr[i]=arr[i]+number;
}
return arr;
}
public static int[] modnumber(int[] arr){
for (int i = 0; i < arr.length; i++) {
arr[i]=arr[i]%10;
}
return arr;
}
public static int reversenumber(int[] array){
int result=0;
for (int i = 0; i < array.length; i++) {
result=result*10+array[i];
}
return result;
}
}