zoukankan      html  css  js  c++  java
  • 判断身份证:要么是15位,要么是18位,最后一位可以为字母,并写程序提出其中的年月日 (正则表达式)

    package com.test;
    
    import java.util.regex.Matcher;
    import java.util.regex.Pattern;
    
    public class ID {
    	public static void main(String[] args) {
    		String[] strs = { "130681198712092019", "13068119871209201x", "13068119871209201", "123456789012345",
    				"12345678901234x", "1234567890123" };
    		Pattern p1 = Pattern.compile("(\d{17}[0-9a-zA-Z]|\d{14}[0-9a-zA-Z])");
    		for (int i = 0; i < strs.length; i++) {
    			Matcher matcher = p1.matcher(strs[i]);
    			System.out.println(strs[i] + ":" + matcher.matches());
    		}
    		Pattern p2 = Pattern.compile("\d{6}(\d{8}).*"); // 用于提取出生日字符串
    		Pattern p3 = Pattern.compile("(\d{4})(\d{2})(\d{2})");// 用于将生日字符串进行分解为年月日
    		for (int i = 0; i < strs.length; i++) {
    			Matcher matcher = p2.matcher(strs[i]);
    			boolean b = matcher.find();
    			if (b) {
    				String s = matcher.group(1);
    				Matcher matcher2 = p3.matcher(s);
    				if (matcher2.find()) {
    					System.out.println(
    							"生日为" + matcher2.group(1) + "年" + matcher2.group(2) + "月" + matcher2.group(3) + "日");
    				}
    			}
    		}
    	}
    }
    

      

  • 相关阅读:
    Beta 冲刺(7/7)
    Beta 冲刺(6/7)
    Beta 冲刺(5/7)
    Beta 冲刺(4/7)
    Beta 冲刺(3/7)
    Beta 冲刺(2/7)
    Beta 冲刺(1/7)
    福大软工 · 第十次作业
    Adobe acrobat DC 2020 激活方法
    物理八年级下册2
  • 原文地址:https://www.cnblogs.com/TaoLeonis/p/7140518.html
Copyright © 2011-2022 走看看