数据结构
网络
关系型数据库管理系统
操作系统
Java
MS Excel
iOS
HTML
CSS
Android
Python
C 编程
C++
C#
MongoDB
MySQL
Javascript
PHP
物理学
化学
生物学
数学
英语
经济学
心理学
社会学
时尚学
法律学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[]) {
//Reading String from user
System.out.println("Enter a string");
Scanner sc = new Scanner(System.in);
String input = sc.nextLine();
//Regular expression
String regex = "[\p{Graph}]";
//Compiling the regular expression
Pattern pattern = Pattern.compile(regex);
//Retrieving the matcher object
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 tutorialspoint 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[] ) {
//Regular expression to match lower case letters
String regex = "^\p{Graph}+$";
//Getting the input data
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();
}
//Creating a Pattern object
Pattern p = Pattern.compile(regex);
System.out.println("Strings with only visible characters: ");
for(int i=0; i<5;i++) {
//Creating a Matcher object
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
更新于：2020 年 1 月 9 日
436 次查看
广告