Posix字符类Java正则表达式
此类\p{IsAlphabetic}与字母字符匹配。
例子1
import java.util.Scanner;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class Example1 {
public static void main(String args[]) {
//从用户读取字符串
System.out.println("Enter a string");
Scanner sc = new Scanner(System.in);
String input = sc.nextLine();
//正则表达式
String regex = "\\p{IsAlphabetic}";
//Compiling the 正则表达式
Pattern pattern = Pattern.compile(regex);
//检索匹配器对象
Matcher matcher = pattern.matcher(input);
int count = 0;
while(matcher.find()) {
count++;
}
System.out.println("Number of alphabetic characters: "+count);
}
}输出结果
Enter a string sample text Number of alphabetic characters: 10
例子2
import java.util.Scanner;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class Example2 {
public static void main(String args[]) {
//正则表达式 to match lower case letters
String regex = "^.*\\p{IsAlphabetic}.*$";
//获取输入数据
Scanner sc = new Scanner(System.in);
System.out.println("Enter 5 input strings: ");
String input[] = new String[5];
for (int i=0; i<5; i++) {
input[i] = sc.nextLine();
}
//创建一个Pattern对象
Pattern p = Pattern.compile(regex);
System.out.println("Strings with alphabetic characters: ");
for(int i=0; i<5;i++) {
//创建一个Matcher对象
Matcher m = p.matcher(input[i]);
if(m.matches()) {
System.out.println(m.group());
}
}
}
}输出结果
Enter 5 input strings: hello sample 243test ##$$@ 222356 Strings with alphabetic characters: hello sample 243test
热门推荐
10 小侄过生日祝福语简短
11 小店营业的祝福语简短
12 担任老师的祝福语简短
13 饮料吧台祝福语简短大气
14 公司新春搞笑祝福语简短
15 高情商敬酒祝福语简短
16 婚礼祝福语新郎妹妹简短
17 教师答辩通过祝福语简短
18 生女孩红包简短祝福语
