将字符串里的大写字母转换后其对应小写字母的后n个字母算法
采用正则表达式判断输入字符串的合法性,然后对其进行转换。
package test;
import java.util.Scanner;
public class TonLowChar {
public static void main(String[] args){
Scanner scanner = new Scanner(System.in);
String str = scanner.nextLine();
char[] chArray = str.toCharArray();
int n = scanner.nextInt();
boolean flag = str.matches("^[A-Za-z]+$");
if(!flag){
System.out.println("Input inlegal.");
}else{
tonlowchar(chArray,n);
System.out.println(String.valueOf(chArray));
}
}
private static void tonlowchar(char[] array,int n ) {
// TODO Auto-generated method stub
for(int i=0;i<array.length;i++){
int num = array[i];
if('A'<= num && num<='Z'){
char newChar = (char)(97+(num+26+n-65)%26);
array[i] = newChar;
}
}
}
}
输出结果:
DFF34234DFSF
5
Input inlegal.