• Android 内存泄漏优化总结


    1,验证是否为汉字

    1
    2
    3
    4
    5
    6
    7
    8
    9
    10
    11
    12
    13
    14
    15
    16
    17
    18
    19
    20
    21
    22
    23
    24
    25
    26
    27
    28
    29
    30
    31
    32
    33
    34
    35
    // 验证昵称
        private boolean verifyNickname() {
            String nickname = edt_username.getText().toString();
            if (nickname == null || nickname.length() == 0) {
                edt_username.setError("不能为空");
                return false;
            }
            int len = 0;
            char[] nickchar = nickname.toCharArray();
            for (int i = 0; i < nickchar.length; i++) {
                if (isChinese(nickchar[i])) {
                    len += 2;
                } else {
                    len += 1;
                }
            }
            if (len < 4 || len > 15) {
                edt_username.setError("正确的昵称应该为 1、4-15个字符 2、2-7个汉字 3、不能是邮箱和手机号");
                return false;
            }
            return true;
        }
     
        private boolean isChinese(char c) {
            Character.UnicodeBlock ub = Character.UnicodeBlock.of(c);
            if (ub == Character.UnicodeBlock.CJK_UNIFIED_IDEOGRAPHS
                    || ub == Character.UnicodeBlock.CJK_COMPATIBILITY_IDEOGRAPHS
                    || ub == Character.UnicodeBlock.CJK_UNIFIED_IDEOGRAPHS_EXTENSION_A
                    || ub == Character.UnicodeBlock.GENERAL_PUNCTUATION
                    || ub == Character.UnicodeBlock.CJK_SYMBOLS_AND_PUNCTUATION
                    || ub == Character.UnicodeBlock.HALFWIDTH_AND_FULLWIDTH_FORMS) {
                return true;
            }
            return false;
        }


    2,验证手机号,邮箱

    1
    2
    3
    4
    5
    6
    7
    8
    9
    10
    11
    12
    13
    14
    15
    // 判断是否为手机号
        private boolean isPhone(String inputText) {
            Pattern p = Pattern
                    .compile("^((13[0-9])|(15[^4,\D])|(18[0,5-9]))\d{8}$");
            Matcher m = p.matcher(inputText);
            return m.matches();
        }
     
        // 判断格式是否为email
        public boolean isEmail(String email) {
            String str = "^([a-zA-Z0-9_\-\.]+)@((\[[0-9]{1,3}\.[0-9]{1,3}\.[0-9]{1,3}\.)|(([a-zA-Z0-9\-]+\.)+))([a-zA-Z]{2,4}|[0-9]{1,3})(\]?)$";
            Pattern p = Pattern.compile(str);
            Matcher m = p.matcher(email);
            return m.matches();
        }
     

    推推族,免费得门票,游景区:www.tuituizu.com

    结伴旅游,一个免费的交友网站:www.jieberu.com

  • 相关阅读:
    并查集
    结构体字节对齐
    Dijkstra算法(单源最短路径)
    图的遍历
    二叉树的非递归遍历
    浅谈C语言中的联合体
    二叉排序(查找)树
    KMP算法
    C语言文件操作解析(四)
    Trie树
  • 原文地址:https://www.cnblogs.com/rabbit-bunny/p/4231481.html
Copyright © 2020-2023  润新知