Posix字符类\ p {Graph} Java正则表达式
此类匹配所有可见字符，即字母，数字，标点符号。
例子1
import java.util.Scanner;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class VisiblieCharacters {
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{Graph}]";
//Compiling the 正则表达式
Pattern pattern = Pattern.compile(regex);
//检索匹配器对象
Matcher matcher = pattern.matcher(input);
int count = 0;
while(matcher.find()) {
count++;
}
System.out.println("Number of visible characters: "+count);
}
}输出1
Enter a string öäü çã Ã test Number of visible characters: 4
输出2
Enter a string welcome to nhooo Number of visible characters: 23
例子2
import java.util.Scanner;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class Example {
public static void main( String args[] ) {
//正则表达式 to match lower case letters
String regex = "^\\p{Graph}+$";
//获取输入数据
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 only visible 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öäüçãà öäüçãà Hello1234 1234 welcome Strings with only visible characters: Hello1234 1234 welcome