一些格式的Java工具类

2015/06/02 33379

清华大佬耗费三个月吐血整理的几百G的资源，免费分享！....>>>

?
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
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
public class FormatTools { 
    /**
     * 判断邮箱
     * 
     * @param email
     * @return
     */ 
    public static 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(); 
    } 
   
    // 判断手机号 
    public static boolean IsPhoneNum(String mobiles) { 
        if (mobiles.trim().length() == 11) { 
            Pattern p = Pattern 
                    .compile("^((13[0-9])|(15[^4,\\D])|(18[0,2,5-9]))\\d{8}$"); 
            Matcher m = p.matcher(mobiles); 
            Log.d("IsPhoneNum", m.matches() + ""); 
            return m.matches(); 
        } 
        return false; 
   
    } 
   
    // 判断座机 
    public static boolean IsCallNum(String mobiles) { 
        boolean isValid = false; 
        CharSequence inputStr = mobiles; 
        Pattern pattern = Pattern.compile("^(0\\d{2,3})(\\d{7,8})(\\d{3,})?$"); 
        Matcher matcher = pattern.matcher(inputStr); 
        if (matcher.matches()) { 
            isValid = true; 
        } 
        return isValid; 
    } 
   
    // 判断手机或座机 
    public static boolean IsAllCallNum(String mobiles) { 
        boolean isValid = false; 
        String expression = "(^((13[0-9])|(15[^4,\\D])|(18[0,2,5-9]))\\d{8}$)|" 
                + "(^(0\\d{2,3})(\\d{7,8})(\\d{3,})?$)"; 
        CharSequence inputStr = mobiles; 
        Pattern pattern = Pattern.compile(expression); 
        Matcher matcher = pattern.matcher(inputStr); 
        if (matcher.matches()) { 
            isValid = true; 
        } 
        return isValid; 
    } 
   
    // 判断字符串是数字 
    public static boolean isNumeric(String str) { 
        for (int i = 0; i < str.length(); i++) { 
            // System.out.println(str.charAt(i)); 
            if (!Character.isDigit(str.charAt(i))) { 
                return false; 
            } 
        } 
        return true; 
    } 
   
    /**
     * 判断是否为整数
     * 
     * @param str 传入的字符串
     * 
     * @return 是整数返回true,否则返回false
     */ 
   
    public static boolean isInteger(String str) { 
        Pattern pattern = Pattern.compile("^[-\\+]?[\\d]*$"); 
        return pattern.matcher(str).matches(); 
    } 
   
    /**
     * 判断是否符合密码规则
     *  6-16为字母数字集合 不包含非法字符
     * @param str
     * @return
     */ 
    public static boolean isPwd(String str) { 
        Pattern pattern = Pattern.compile("^[a-z0-9A-Z]+$"); 
        return pattern.matcher(str).matches(); 
    } 
   
    /**
     * 将秒转换成小时分钟
     * 
     * @param second
     * @return
     */ 
    public static String changeTotime(int second) { 
        int h = 0; 
        int d = 0; 
        int s = 0; 
        int temp = second % 3600; 
        if (second > 3600) { 
            h = second / 3600; 
            if (temp != 0) { 
                if (temp > 60) { 
                    d = temp / 60; 
                    if (temp % 60 != 0) { 
                        s = temp % 60; 
                    } 
                } else { 
                    s = temp; 
                } 
            } 
        } else { 
            d = second / 60; 
            if (second % 60 != 0) { 
                s = second % 60; 
            } 
        } 
   
        // return h + "小时" + d + "分钟" + s + "秒"; 
        return h + "小时" + d + "分钟"; 
    } 
   
    /**
     * 米转换成公里
     * 
     * @return
     */ 
    public static String miToGl(int distance) { 
        double dis = Math.round(distance / 100d) / 10d; 
        return dis + "公里"; 
    } 
}