我不太习惯写一大堆的长篇论文,所以本文章以代码形式,以注释的形式把每行代码解释清楚,然后最后会整理一下开发思路,剩下的就靠你们自己了。
- 获取姓氏
//定义所有的复姓。如果觉得局限性大,你也可以去存储到数据库中,方便维护,用的时候就取出来 不一定非要用数组 集合也可以
public static List<String> nameSplit(String name){
String[] bai = {
"欧阳", "太史", "上官", "端木", "司马", "东方", "独孤", "南宫", "万俟", "闻人", "夏侯", "诸葛", "尉迟", "公羊", "赫连", "澹台",
"皇甫", "宗政", "濮阳", "公冶", "太叔", "申屠", "公孙", "慕容", "仲孙", "钟离", "长孙", "宇文", "司徒", "鲜于", "司空", "闾丘", "子车",
"亓官", "司寇", "巫马", "公西", "颛孙", "壤驷", "公良", "漆雕", "乐正", "宰父", "谷梁", "拓跋", "夹谷", "轩辕", "令狐", "段干", "百里",
"呼延", "东郭", "南门", "羊舌", "微生", "公户", "公玉", "公仪", "梁丘", "公仲", "公上", "公门", "公山", "公坚", "左丘", "公伯", "西门",
"公祖", "第五", "公乘", "贯丘", "公皙", "南荣", "东里", "东宫", "仲长", "子书", "子桑", "即墨", "达奚", "褚师", "吴铭"};
//截取传过来的姓名 截取前两位
String newName = name.substring(0, 2);
//等会用来存储返回值的
List<String> names = new ArrayList<String>();
//定义是否是复姓
boolean flag = false;
for (int i = 0; i < bai.length; i++) {
//循环遍历数组,判断我们截取出来的前两位的字符 是否与复姓数组中有相同值的,如果有,那他就是复姓
if (newName.equals(bai[i])) {
names.add(newName);
names.add(name.substring(2));
flag = true;
break;
}
}
//上面已经跑过了循环 如果有复姓 flag就是true 如果没有我们就走下面的方法
if (!flag) {
//如果不是复姓 那你传过来的名字的第一个字符就一定是单姓了 直接获取第一个字符就可以
names.add(name.charAt(0) + "");
names.add(name.substring(1));
return names;
}
return names;
- 获取姓氏的笔画数
public static int getStrokeCount(char charcator) {
//表示定义了byte类型数组,但是数组的长度为0,在堆区有地址值
byte[] bytes = new byte[0];
try {
//这个地方是将传过来的字符转换成gb2312编码 这个地方有可能出现异常 你可以捕获或者去抛出。
bytes = (String.valueOf(charcator)).getBytes("gb2312");
} catch (UnsupportedEncodingException e) {
e.printStackTrace();
}
//bytes的长度 有且只能为1 注意:这是因为gb2312编码的缘故,感兴趣的可以自行度娘查阅各个编码获取bytes的数组长度
if (bytes == null || bytes.length > 2 || bytes.length <= 0) {
// 错误引用,非合法字符
return 0;
}
if (bytes.length == 1) {
// 英文字符
return 0;
}
if (bytes.length == 2) {
// 中文字符
int highByte = 256 + bytes[0];
int lowByte = 256 + bytes[1];
return GetGB2312StrokeCountM(highByte, lowByte);
}
// 未知错误
return 0;
}
public static int GetGB2312StrokeCountM(int c1, int c2) {
int OffSet;
if (c1 < 0xB0 || c1 > 0xF7 || c2 < 0xA1 || c2 > 0xFE) {
// 不是一个有效的GB2312汉字字符
return -1;
}
OffSet = (c1 - 0xB0) * (0xFE - 0xA0) + (c2 - 0xA1);
return gb2312StrokeCount[OffSet];
}
//存储GB2312汉字字符的笔画数的列表
//这个正常来说 如果觉得写在工具类里太麻烦 你就去写个专门的类存储这个信息,然后在这里直接获取就可以了
private static int[] gb2312StrokeCount = {
/* B0 */
10, 7, 10, 10, 8, 10, 9, 11,
17, 14, 13, 5, 13, 10, 12, 15,
10, 6, 10, 9, 13, 8, 10, 10,
8, 8, 10, 5, 10, 14, 16, 9,
12, 12, 15, 15, 7, 10, 5, 5,
7, 10, 2, 9, 4, 8, 12, 13,
7, 10, 7, 21, 10, 8, 5, 9,
6, 13, 8, 8, 9, 13, 12, 10,
13, 7, 10, 10, 8, 8, 7, 8,
7, 19, 5, 4, 8, 5, 9, 10,
14, 14, 9, 12, 15, 10, 15, 12,
12, 8, 9, 5, 15, 10,
/* B1 */
16, 13, 9, 12, 8, 8, 8, 7,
15, 10, 13, 19, 8, 13, 12, 8,
5, 12, 9, 4, 9, 10, 7, 8,
12, 12, 10, 8, 8, 5, 11, 11,
11, 9, 9, 18, 9, 12, 14, 4,
13, 10, 8, 14, 13, 14, 6, 10,
9, 4, 7, 13, 6, 11, 14, 5,
13, 16, 17, 16, 9, 18, 5, 12,
8, 9, 9, 8, 4, 16, 16, 17,
12, 9, 11, 15, 8, 19, 16, 7,
15, 11, 12, 16, 13, 10, 13, 7,
6, 9, 5, 8, 9, 9,
/* B2 */
10, 6, 8, 11, 15, 8, 10, 8,
12, 9, 13, 10, 14, 7, 8, 11,
11, 14, 12, 8, 7, 10, 2, 10,
7, 11, 4, 5, 7, 19, 10, 8,
17, 11, 12, 7, 3, 7, 12, 15,
8, 11, 11, 14, 16, 8, 10, 9,
11, 11, 7, 7, 10, 4, 7, 17,
16, 16, 15, 11, 9, 8, 12, 8,
5, 9, 7, 19, 12, 3, 9, 9,
9, 14, 12, 14, 7, 9, 8, 8,
10, 10, 12, 11, 14, 12, 11, 13,
11, 6, 11, 19, 8, 11,
/* B3 */
6, 9, 11, 4, 11, 7, 2, 12,
8, 11, 10, 12, 7, 9, 12, 15,
15, 11, 7, 8, 4, 7, 15, 12,
7, 15, 10, 6, 7, 6, 11, 7,
7, 7, 12, 8, 15, 10, 9, 16,
6, 7, 10, 12, 12, 15, 8, 8,
10, 10, 10, 6, 13, 9, 11, 6,
7, 6, 6, 10, 8, 8, 4, 7,
10, 5, 9, 6, 6, 6, 11, 8,
8, 13, 12, 14, 13, 13, 13, 4,
11, 14, 4, 10, 7, 5, 16, 12,
18, 12, 13, 12, 9, 13,
/* B4 */
10, 12, 24, 13, 13, 5, 12, 3,
9, 13, 7, 11, 12, 7, 9, 12,
15, 7, 6, 6, 7, 8, 11, 13,
8, 9, 13, 15, 10, 11, 7, 21,
18, 11, 11, 9, 14, 14, 13, 13,
10, 7, 6, 8, 12, 6, 15, 12,
7, 5, 4, 5, 11, 11, 15, 17,
9, 19, 16, 12, 14, 11, 13, 10,
13, 14, 11, 14, 7, 6, 3, 14,
15, 12, 11, 10, 13, 12, 6, 12,
14, 5, 3, 7, 4, 12, 17, 9,
9, 5, 9, 11, 9, 11,
/* B5 */
9, 10, 8, 4, 8, 10, 11, 9,
5, 12, 7, 11, 11, 8, 11, 11,
6, 9, 10, 9, 10, 2, 10, 17,
10, 7, 11, 6, 8, 15, 11, 12,
11, 15, 11, 8, 19, 6, 12, 12,
17, 14, 4, 12, 7, 14, 8, 10,
11, 7, 10, 14, 14, 8, 8, 6,
12, 11, 9, 7, 10, 12, 16, 11,
13, 13, 9, 8, 16, 9, 5, 7,
7, 8, 11, 12, 11, 13, 13, 5,
16, 10, 2, 11, 6, 8, 10, 12,
10, 14, 15, 8, 11, 13,
/* B6 */
2, 7, 5, 7, 8, 12, 13, 8,
4, 6, 5, 5, 12, 15, 6, 9,
8, 9, 7, 9, 11, 7, 4, 9,
7, 10, 12, 10, 13, 9, 12, 9,
10, 11, 13, 12, 7, 14, 7, 9,
12, 7, 14, 12, 14, 9, 11, 12,
11, 7, 4, 5, 15, 7, 19, 12,
10, 7, 9, 9, 12, 11, 9, 6,
6, 9, 13, 6, 13, 11, 8, 12,
11, 13, 10, 12, 9, 15, 6, 10,
10, 4, 7, 12, 11, 10, 10, 6,
2, 6, 5, 9, 9, 2,
/* B7 */
9, 5, 9, 12, 6, 4, 9, 8,
9, 18, 6, 12, 18, 15, 8, 8,
17, 3, 10, 4, 7, 8, 8, 5,
7, 7, 7, 7, 4, 8, 8, 6,
7, 6, 6, 7, 8, 11, 8, 11,
3, 8, 10, 10, 7, 8, 8, 8,
9, 7, 11, 7, 8, 4, 7, 7,
12, 7, 10, 8, 6, 8, 12, 12,
4, 9, 8, 13, 10, 12, 4, 9,
11, 10, 5, 13, 6, 8, 4, 7,
7, 4, 15, 8, 14, 7, 8, 13,
12, 9, 11, 6, 9, 8,
/* B8 */
10, 11, 13, 11, 5, 7, 7, 11,
10, 10, 8, 11, 12, 8, 14, 9,
11, 18, 12, 9, 12, 5, 8, 4,
13, 6, 12, 4, 7, 6, 13, 8,
15, 14, 8, 7, 13, 9, 11, 12,
3, 5, 7, 9, 9, 7, 10, 13,
8, 11, 21, 4, 6, 9, 9, 7,
7, 7, 12, 7, 16, 10, 10, 14,
10, 16, 13, 15, 15, 7, 10, 14,
12, 4, 11, 10, 8, 12, 9, 12,
10, 12, 9, 12, 11, 3, 6, 9,
10, 13, 10, 7, 8, 19,
/* B9 */
10, 10, 11, 3, 7, 5, 10, 11,
8, 10, 4, 9, 3, 6, 7, 9,
7, 6, 9, 4, 7, 8, 8, 9,
8, 8, 11, 12, 11, 8, 14, 7,
8, 8, 8, 13, 5, 11, 9, 7,
8, 9, 10, 8, 12, 8, 5, 9,
14, 9, 13, 8, 8, 8, 12, 6,
8, 9, 6, 14, 11, 23, 12, 20,
8, 6, 3, 10, 13, 8, 6, 11,
5, 7, 9, 6, 9, 8, 9, 10,
8, 13, 9, 8, 12, 13, 12, 12,
10, 8, 8, 14, 6, 9,
15, 9, 10, 10, 6, 10, 9, 12,
14, 7, 12, 7, 11, 12, 8, 12,
7, 16, 16, 10, 7, 16, 10, 11,
6, 5, 5, 8, 10, 17, 17, 14,
11, 9, 6, 10, 5, 10, 8, 12,
10, 11, 10, 5, 8, 7, 6, 11,
13, 9, 8, 11, 14, 14, 15, 9,
15, 12, 11, 9, 9, 9, 10, 7,
15, 16, 9, 8, 9, 10, 9, 11,
9, 7, 5, 6, 12, 9, 12, 7,
9, 10, 6, 8, 5, 8, 13, 10,
12, 9, 15, 8, 15, 12,
/* BB */
8, 8, 11, 7, 4, 7, 4, 7,
9, 6, 12, 12, 8, 6, 4, 8,
13, 9, 7, 11, 7, 6, 8, 10,
7, 12, 10, 11, 10, 12, 13, 11,
10, 9, 4, 9, 12, 11, 16, 15,
17, 9, 11, 12, 13, 10, 13, 9,
11, 6, 9, 12, 17, 9, 12, 6,
13, 10, 15, 5, 12, 11, 10, 11,
6, 10, 5, 6, 9, 9, 9, 8,
11, 13, 9, 11, 17, 9, 6, 4,
10, 8, 12, 16, 8, 11, 5, 6,
11, 6, 13, 15, 10, 14,
/* BC */
6, 5, 9, 16, 4, 7, 10, 11